POJ - 2406——Power Strings （循环节恰好形成字符串的次数）

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.

题意:求出循环节恰好形成字符串的循环次数。

思路:len-next[len]是最小形成循环节的长度，len/(len-next[len])就是循环节形成字符串的次数。但是有个坑点（在这个坑点wa了一发）在于len-next[len]是最小的循环长度，在字符串长度取余循环节不等于0的时候，字符串的循环节长度应该是len，答案也就不再是 len/(len-next[len])，而是1。

#include<stdio.h>
#include<algorithm>
#include<string.h>
char a[1000010];
int nextt[1000010],len;
void KMP()
{
    int i=0,j=-1;
    nextt[0]=-1;
    while(i<len)
    {
        if(j==-1||a[i]==a[j])
        {
            nextt[++i]=++j;
        }
        else
            j=nextt[j];
    }

}
int main()
{
    while(~scanf("%s",a),a[0]!='.')
    {

        len=strlen(a);
        KMP();
        int tem=len-nextt[len];
        if(len%tem==0)
        printf("%d\n",len/tem);
        else
            printf("1\n");
    }
}