KMP next模板

Power Strings

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 47895		Accepted: 19949

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

POJ2406

#include<stdio.h>
#include<string.h>
#define maxn 10000001
char s1[maxn];
int next[maxn];
void get_nextval(char s[maxn])
{
    int j=0,k=-1;
    next[0]=-1;
    while(s[j]!='\0')
    {
        if(s[j]==s[k]||k==-1)
        {
            ++j;
            ++k;
            if(s[j]!=s[k])
                next[j]=k;
            else
                next[j]=next[k];
        }
        else
            k=next[k];
    }

}

int main()
{
    int l;
    while(scanf("%s",s1)!=EOF)
    {
        if(s1[0]=='.')
            break;
        get_nextval(s1);
        l=strlen(s1);
        if(l%(l-next[l])==0)
            printf("%d\n",l/(l-next[l]));
        else
            printf("1\n");

    }
}