hdoj 3746(kmp)

 1 #include<cstdio>
 2 #include<cstring>
 3 using namespace std;
 4 int n;
 5 char a[100600];
 6 int next[100600];
 7 
 8 void get_next()
 9 {
10     next[0]=-1;
11     int tmp=-1,i=0;
12     while(i!=n){
13         if(tmp==-1 || a[i]== a[tmp])
14             next[++i]=++tmp;
15         else
16             tmp=next[tmp];
17     }
18 }
19 
20 int main()
21 {
22     int T;
23     scanf("%d",&T);
24     while(T--){
25         scanf("%s",a);
26         n=strlen(a);
27         get_next();
28         int length=n-next[n];
29 //        printf("%d %d %d\n",n,length,next[n]);
30         if(n!=length&&n%length==0)
31             printf("0\n");
32         else{
33             int ans=length-next[n]%length;
34             printf("%d\n",ans);
35         }
36     }
37     return 0;
38 }