Pagini recente » Cod sursa (job #1163520) | Cod sursa (job #1615313) | Cod sursa (job #1151081) | Cod sursa (job #2724507) | Cod sursa (job #927393)
Cod sursa(job #927393)
#include<cstdio>
using namespace std;
#define MAX 1000005
int T , pi[MAX] , q , best[MAX];
char s[MAX];
bool ok[MAX];
int main()
{
freopen("prefix.in" , "r" , stdin );
freopen("prefix.out" , "w" , stdout);
scanf("%d" , &T);
for(int i = 1 ; i <= T ; ++i )
{
scanf("%s" , s+1);
pi[0] = pi[1] = 0;
q = 0;
for(int i = 2 ; s[i] ; ++i )
{
while(s[i]!=s[q+1] && q)
q = pi[q];
if(s[i] == s[q+1])
q++;
pi[i] = q;
}
int maxx = 0;
for(int i = 1 ; s[i] ; ++i )
if(pi[i] && pi[i]%(i-pi[i])==0)
maxx = i;
printf("%d\n" , maxx );
}
return 0;
}