题目描述
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?
输入描述:
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.
输出描述:
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".
输入例子:
3 Itai nyan~ Ninjin wa iyadanyan~ uhhh nyan~
输出例子:
nyan~
代码:
#include"iostream"
#include "cstring"
#include "cmath"
#include "vector"
#include<iomanip>
using namespace std;
int main()
{
char str[100][256];
vector<char> sentence[100];
vector<char> result;
int N;
cin >> N;
getchar();
for (int i = 0; i < N; i++)
{
char temp;
while ((temp = getchar()) != '\n')
{
sentence[i].push_back(temp);
}
}
int i = sentence[0].size() - 1, j = sentence[1].size() - 1;
while (sentence[0][i] == sentence[1][j])
{
result.push_back(sentence[0][i]);
i--, j--;
}
for (int i = 2; i < N; i++)
{
int k = 0;
for (int j = sentence[i].size() - 1; j >= sentence[i].size() - result.size(); j--, k++)
if (result[k] != sentence[i][j])
{
while (k < result.size())
{
result.pop_back();
}
break;
}
}
if (result.size() == 0)
cout << "nai";
for (int i = result.size() - 1; i >= 0; i--)
cout << result[i];
}
重点:
无