Pagini recente » Cod sursa (job #3288019) | Cod sursa (job #2451250) | Cod sursa (job #2264871) | Cod sursa (job #2000469) | Cod sursa (job #1300718)
#include <iostream>
#include <cstring>
#include <fstream>
using namespace std;
char s[1000002];
int n, tests, i, l, nr, un, sol;
int main()
{
ifstream cin("prefix.in");
ofstream cout("prefix.out");
cin>>tests;
while(tests--)
{ cin>>s+1;
nr=0, un=0, sol=0, l=1, s[0]='A', n=strlen(s)-1;
for(i=1; i<=n; ++i)
{
if(s[i]==s[i-l]&&(i==n||s[i+1]==s[i+1-l]||un+1==l))
nr=un+1;
else
{
nr=0;
l=i;
}
if(nr==l)
{
nr=0;
sol=i;
}
un=nr;
}
cout<<sol<<'\n';
}
return 0;
}