1077 Kuchiguse （20 分）

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

C++:

/*
 @Date    : 2018-02-14 18:03:31
 @Author  : 酸饺子 (changzheng300@foxmail.com)
 @Link    : https://github.com/SourDumplings
 @Version : $Id$
*/

/*
https://www.patest.cn/contests/pat-a-practise/1077
 */

#include <iostream>
#include <cstdio>
#include <string>

using namespace std;

int main(int argc, char const *argv[])
{
    int N;
    scanf("%d\n", &N);
    string first, second, ku;
    getline(cin, first);
    getline(cin, second);
    int l1 = first.length(), l2 = second.length();
    int i, j;
    for (i = l1 - 1, j = l2 - 1; i >= 0 && j >= 0 && first[i] == second[j]; --i, --j);
    ku = std::move(first.substr(i+1));
    N -= 2;
    while (N--)
    {
        string next;
        getline(cin, next);
        int l = next.length(), k = ku.length();
        for (i = l - 1, j = k - 1; i >= 0 && j >= 0 && next[i] == ku[j]; --i, --j);
        if (j >= 0)
            ku.erase(ku.begin(), ku.begin() + j + 1);
    }
    if (ku.length())
        cout << ku << endl;
    else
        cout << "nai" << endl;
    return 0;
}