1077 Kuchiguse (20分)
-
只能通过第一个测试点,在牛客上看了其他测试点,在我的机器上可以跑出来,但是牛客上的答案就不对....这到底是为什么!!!
-
reverse头文件 algorithm
-
find
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
string s1,s2,common;
int N;
scanf("%d\n", &N);
getline(cin,s1);
getline(cin,s2);
int s1L = (int)s1.length()-1;
int s2L = (int)s2.length()-1;
while(s1L != 0 || s2L != 0)
{
if (s2[s2L] == s1[s1L])
{
common += s1[s1L];
s2L--;
s1L--;
}
else
break;
}
reverse(common.begin(), common.end());
int flag = 1;
for (int i = 0; i < N - 1; i++)
{
getline(cin, s2);
if (s2.find(common) == s2.npos || (int)common.length() == 0)
{
flag = 0;
break;
}
}
if (flag == 0) cout << "nai"<<endl;
else cout << common << endl;
return 0;
}