Power Strings(kmp 重复子串)

http://poj.org/problem?id=2406

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<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
int next[1000009],len;
char s[1000009];
void getnext()
{
    int i=0,j=-1;
    next[0]=-1;

    while(i<len)
    {
        if(j==-1||s[i]==s[j])
            next[++i]=++j;
        else j=next[j];
    }
}
int main()
{

    while(scanf("%s",s)!=EOF)
    {
        len=strlen(s);
        if(len==1&&s[0]=='.')break;
        getnext();
        if(next[len]==0||len%(len-next[len])!=0)printf("1\n");
        else printf("%d\n",len/(len-next[len]));
    }
    return 0;
}