1077. Kuchiguse (20)

#include<cstdio>
#include<cstring>
char s[100][257];
int main()
{
    int n, max = -1;
    scanf("%d", &n);
    getchar();
    int nn = n;
    while (n--)
    {
        gets(s[n]);
    }
    int len = strlen(s[0]);
    for (int i = 1; i < nn; i++)
    {
        int tem = strlen(s[i]);
        int len0 = len;
        for (int j = tem; j >= 0&&len0>=0; j--,len0--)
        {
            if (s[i][j] != s[0][len0])
                break;
        }
        if (max<len0)
            max= len0;
    }
    if (max == len-1)//最后的'\0'相等
        printf("nai"); 
    else
        for (int i = max+1; i <len; i++)
        { 
            printf("%c", s[0][i]);
        }
    return 0;
}