Pagini recente » Cod sursa (job #2433274) | Cod sursa (job #1401146) | Cod sursa (job #2054415) | Cod sursa (job #13317) | Cod sursa (job #1642892)
#include<fstream>
using namespace std;
ifstream in("prefix.in");
ofstream out("prefix.out");
const int NMAX = 1000005;
char s[NMAX];
int N,poz[NMAX],M;
int solve()
{
int k = 0,ret =0;
poz[1] = 0;
for(int i = 2 ; s[i] ; ++i){
while(k && s[k + 1] != s[i])
k = poz[k];
if(s[k+1] == s[i])
++k;
poz[i] = k;
if( poz[i] % (i - poz[i]) == 0 && poz[i] *2 >= i)
ret = i;
}
return ret;
}
int main()
{
(in>>N).ignore(1);
for( ; N ; --N){
in.getline(s + 1,NMAX);
out<<solve()<<"\n";
}
in.close();
out.close();
return 0;
}