PTAKuchiguse (20分)

tech2022-12-25  104

释放无限光明的是人心,制造无边黑暗的也是人心,光明和黑暗交织着,厮杀着,这就是我们为之眷恋又万般无奈的人世间。

The Japanese language is notorious for its sentence ending particles. Personal preference of such particles can be considered as a reflection of the speaker's personality. Such a preference is called "Kuchiguse" and is often exaggerated artistically in Anime and Manga. For example, the artificial sentence ending particle "nyan~" is often used as a stereotype for characters with a cat-like personality:

Itai nyan~ (It hurts, nyan~)

Ninjin wa iyada nyan~ (I hate carrots, nyan~)

Now given a few lines spoken by the same character, can you find her Kuchiguse?

Input Specification:

Each input file contains one test case. For each case, the first line is an integer N (2≤N≤100). Following are N file lines of 0~256 (inclusive) characters in length, each representing a character's spoken line. The spoken lines are case sensitive.

Output Specification:

For each test case, print in one line the kuchiguse of the character, i.e., the longest common suffix of all N lines. If there is no such suffix, write nai.

Sample Input 1:

3 Itai nyan~ Ninjin wa iyadanyan~ uhhh nyan~

Sample Output 1:

nyan~

Sample Input 2:

3 Itai! Ninjinnwaiyada T_T T_T

Sample Output 2:

nai #include <iostream> #include <cstdio> #include <algorithm> #include <string> #include <cstring> #include <cstdlib> #include <cmath> #include <stack> #include <queue> #include <set> #include <map> #include <vector> #include <ctime> #include <cctype> #include <bitset> #include <utility> #include <sstream> #include <complex> #include <iomanip> #include<climits>//INT_MAX #define PP pair<ll,int> #define inf 0x3f3f3f3f #define llinf 0x3f3f3f3f3f3f3f3fll #define dinf 1000000000000.0 #define PI 3.1415926 typedef long long ll; using namespace std; int const mod=1e9+7; const int maxn=3e5+10; int n; string jg; int main() { scanf("%d\n", &n); for (int i = 0; i < n; i++) { string s; getline(cin, s); reverse(s.begin(), s.end()); if (i==0) { jg=s; continue; } else { for(int j=0; j<min(jg.length(), jg.length()); j++) { if(jg[j]!=s[j]) { jg=jg.substr(0, j); break; } } } } reverse(jg.begin(),jg.end()); if(jg.length()==0) printf("nai"); else cout<<jg<<endl; return 0; }

 

最新回复(0)