POJ2406Power Strings[KMP 失配函数]

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=1e6+5;
int n,f[N];
char p[N];
int main(){
    int cas=0;
    while(true){
        scanf("%s",p);
        n=strlen(p);
        if(p[0]==‘.‘) break;
        f[0]=f[1]=0;
        for(int i=1;i<n;i++){
            int j=f[i];
            while(j&&p[j]!=p[i]) j=f[j];
            f[i+1]=p[j]==p[i]?j+1:0;
        }
        if(n%(n-f[n])==0) printf("%d\n",n/(n-f[n]));
        else printf("1\n");
    }
}