(kmp) poj 2406

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<queue>
#include<vector>
#include<stack>
using namespace std;
char s[1000010];
int next[1000010];
void getnext()
{
    next[0]=-1;
    for(int i=1,j=-1;s[i];i++)
    {
        while(j!=-1&&s[j+1]!=s[i]) j=next[j];
        if(s[j+1]==s[i]) j++;
        next[i]=j;
    }
}
int main()
{
    while(scanf("%s",s)!=EOF)
    {
        if(s[0]==‘.‘)
            break;
        int len=strlen(s);
        getnext();
        if(len%(len-next[len-1]-1)==0)
            printf("%d\n",len/(len-next[len-1]-1));
        else
            printf("1\n");
    }
    return 0;
}