题目描述
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.
思路
把所有字符串倒置，看前k个字符是否相同即可
代码
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<cstring>
#include<iostream>
using namespace std;
char lan[105][260];
int main()
{
int n;
scanf("%d", &n);
getchar();
int min = 1000;
for (int i = 0; i < n; i++)
{
cin.getline(lan[i],260);
int len = strlen(lan[i]);
if (len < min)
min = len;
for (int j = 0; j < len / 2; j++)
{
char c = lan[i][j];
lan[i][j] = lan[i][len - 1 - j];
lan[i][len - 1 - j] = c;
}
}
int number = 0;
int pan = 0;
for (int i = 0; i < min; i++)
{
int flag = 1;
char c = lan[0][i];
for (int j = 1; j < n; j++)
{
if (c != lan[j][i])
{
flag = 0;
break;
}
}
if (flag == 1)
{
number++;
pan = 1;
}
else
{
break;
}
}
if (pan == 0)
{
printf("nai");
}
else
for (int i = number - 1; i >= 0; i--)
{
printf("%c", lan[0][i]);
}
printf("\n");
}