PAT 1077. Kuchiguse (20)

来源:互联网 发布:知乎 马蓉限制出境 编辑:程序博客网 时间:2024/05/16 06:53

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:
    3Itai nyan~Ninjin wa iyadanyan~uhhh nyan~
    Sample Output 1:
    nyan~
    Sample Input 2:
    3Itai!Ninjinnwaiyada T_TT_T
    Sample Output 2:
    nai

  • #include <iostream>#include <cstdio>#include <string>#include <cstring>using namespace std;char str1[260], str2[260];int main(void){int n;scanf("%d", &n);getchar();gets(str1);int length1 = strlen(str1), length2;int minIndex = 0;for (int i = 1; i < n; ++i){gets(str2);length2 = strlen(str2);int k1 = length1 - 1, k2 = length2 - 1;while (k1 >= minIndex && k2 >= 0 && str1[k1] == str2[k2]){--k1;--k2;}minIndex = k1 + 1;}if (minIndex != length1)for (int i = minIndex; i < length1; ++i)printf("%c", str1[i]);else printf("nai");printf("\n");return 0;}

    0 0