用kmp查找字符串的循环节

A   B   C   D   E   F   G   H   I

A - A

Time Limit:3000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit   Status

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

Hint

This problem has huge input, use scanf instead of cin to avoid time limit exceed.

#include <stdio.h>
#include <string.h>
int next[1000001];                         //注意数组要开的足够大但也不能超内存
char ch[1000001];
int getnext()                           //获得next数组
{
    int k=-1,j=0;
    next[0]=-1;
    int l=strlen(ch);
    while(j<l)
    {
        if(k==-1||ch[k]==ch[j])
        {
            k++;
            j++;
            if(ch[k]!=ch[j])
                next[j]=k;
            else
                next[j]=next[k];
        }
        else
            k=next[k];
    }
    return 0;
}
int main()
{
    int l,k;
    while(~scanf("%s",ch))
    {
        if(ch[0]=='.')
            break;
        else
        {
            l=strlen(ch);
            getnext();
            if(l%(l-next[l])==0)               //还是不能理解此行代码
                k=l/(l-next[l]);
            else
                k=1;
            printf("%d\n",k);
        }
    }
}