#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
int N, sz, length;
std::string line;
std::vector<std::string> vec;
int main(){
std::cin >> N;
getline(std::cin, line);
sz = 257;
for(int i = 0; i < N; ++i){
getline(std::cin, line);
reverse(line.begin(), line.end());
vec.push_back(line);
if(line.size() < sz){
sz = line.size();
}
}
length = sz;
for(int i = 0; i < sz; ++i){
char c = vec[0][i];
for(int j = 1; j < N; ++j){
if(vec[j][i] != c){
length = i;
i = sz;
break;
}
}
}
if(length == 0){
std::cout << "nai";
} else{
line = vec[0].substr(0, length);
reverse(line.begin(), line.end());
std::cout << line;
}
return 0;
}
题目如下:
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