解法一：不知道为啥在PATA上跑出现“运行时错误”
#include<iostream>
#include<string>
#include<vector>
#include <algorithm>
using namespace std;
bool cmp(string i, string j) {return i.length() < j.length();
}
int main() {vector<string> str;string temp;bool flag = true;int n, k = 1;cin >> n;getline(cin, temp);for (int i = 0; i < n; i++) {getline(cin, temp);if (temp.length() == 0) flag = false;str.push_back(temp);}while (flag) {sort(str.begin(), str.end(), cmp);int len2 = str[0].length();temp = str[0].substr(len2 - k, k);for (int i = 1; i < n; i++) {int len = str[i].length();if (temp.compare(str[i].substr(len - k, k))!=0) {flag = false;temp = temp.substr(1, k - 1);break;}}if(flag) k++;}if (k > 1) cout << temp << endl;else cout << "nai" << endl;return 0;
}解法二：
#include <iostream>
#include <algorithm>
using namespace std;
int main() {int n;scanf("%d\n", &n);string ans;for(int i = 0; i < n; i++) {string s;getline(cin, s);int lens = s.length();reverse(s.begin(), s.end());if(i == 0) {ans = s;continue;} else {int lenans = ans.length();int minlen = min(lens, lenans);for(int j = 0; j < minlen; j++) {if(ans[j] != s[j]) {ans = ans.substr(0, j);break;}}}}reverse(ans.begin(), ans.end());if (ans.length() == 0) ans = "nai";cout << ans;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