Pagini recente » Cod sursa (job #2609728) | Cod sursa (job #2207604) | Cod sursa (job #221816) | Cod sursa (job #2327349) | Cod sursa (job #2774748)
#include<stdio.h>
#include<string.h>
char s[1000001];
int n,k,p[1000001],i,d,t;
int main()
{
freopen("prefix.in","r",stdin),freopen("prefix.out","w",stdout),scanf("%d\n",&t);
while(t--) {
gets(s+1),k=p[1]=d=0,n=strlen(s+1);
for(i=2;i<=n;++i) {
for(;k&&s[k+1]!=s[i];k=p[k]);
if(s[k+1]==s[i])
++k;
p[i]=k;
}
for(i=n;i>1&&!d;--i)
if(p[i]&&i==(i-p[i])*(i/(i-p[i])))
d=i;
printf("%d\n",d);
}
return 0;
}