Pagini recente » Cod sursa (job #3233498) | Cod sursa (job #2176580) | Cod sursa (job #838356) | Cod sursa (job #711816) | Cod sursa (job #1481772)
#include<stdio.h>
#include<string.h>
char s[1000000];
int n,k,p[1000000],i,d,t;
int main() {
freopen("prefix.in","r",stdin),freopen("prefix.out","w",stdout),scanf("%d\n",&t);
while(t--) {
gets(s),k=p[1]=d=0,n=strlen(s);
for(i=1;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=1;i<=n;i++)
if(p[i]&&i%(i-p[i])==0)
d=i;
printf("%d\n",d);
}
}