poj 2406 Power Strings(kmp)

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<queue>
#define ll long long int
using namespace std;
inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int moth[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int dir[4][2]={1,0 ,0,1 ,-1,0 ,0,-1};
int dirs[8][2]={1,0 ,0,1 ,-1,0 ,0,-1, -1,-1 ,-1,1 ,1,-1 ,1,1};
const int inf=0x3f3f3f3f;
const ll mod=1e9+7;
char s[1000007];
int nextt[1000007];
void getnext(){
    nextt[1]=0;
    int len=strlen(s);
    for(int i=2,j=0;i<=len;i++){
        while(j>0&&s[i-1]!=s[j]) j=nextt[j];
        if(s[i-1]==s[j]) j++;
        nextt[i]=j;
    }
}
int main(){
    //ios::sync_with_stdio(false);
    while(~scanf("%s",s)){
        if(strlen(s)==1&&s[0]==‘.‘) break;
        getnext();
        int len=strlen(s);
        int temp=nextt[len];
        while(len%(len-temp)!=0){
            temp=nextt[temp];
            if(len/(len-temp)<2)
            break;
        }
        if(len%(len-temp)==0)
        printf("%d\n",len/(len-temp));
        else printf("1\n");
    }
    return 0;
}