Poj 2406(同1961)

Description

Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication, exponentiation by a non-negative integer is defined in the normal way: a^0 = "" (the empty string) and a^(n+1) = a*(a^n).
Input

Each test case is a line of input representing s, a string of printable characters. The length of s will be at least 1 and will not exceed 1 million characters. A line containing a period follows the last test case.
Output

For each s you should print the largest n such that s = a^n for some string a.
Sample Input

abcd
aaaa
ababab
.
Sample Output

1
4
3

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=2000009;
int next[maxn];
char str[maxn];
void  getNext(char *p,int *next)
{
    int len=strlen(p);
    int i,k;
    next[0]=0;
    for(i=1,k=0;i<len;i++)
    {
        while(k>0&&p[k]!=p[i])
        k=next[k-1];
        if(p[i]==p[k])
        k++;
        next[i]=k;

    }
}
int main()
{
    while(scanf("%s",str)!=EOF&&str[0]!='.')
    {
        memset(next,0,sizeof(next));
        int len=strlen(str);
        getNext(str,next);
       //for(int i=0;i<=len;i++)
       //printf("%d ",next[i]);
       //printf("%d %d\n",len,next[len]);
       if(len%(len-next[len-1])==0)
       printf("%d\n",len/(len-next[len-1]));
       else printf("1\n");


    }
    return 0;
}