Power Strings--KMP，最小循环节

Power Strings

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 44301		Accepted: 18487

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

题目链接：http://poj.org/problem?id=2406

和我上一篇博客完全一样，这就是个水题了。

代码：

#include <cstdio>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <string>
using namespace std;
int next[1000010];
void getnext(char t[]){
    int i=0,j=-1,l;
    next[0]=-1;
    l=strlen(t);
    while(i!=l){
        if(j==-1||t[i]==t[j]){
            ++j;
            ++i;
            next[i]=j;
        }
        else
            j=next[j];
    }
}
char s[1000010];
int main(){
    while(~scanf("%s",s)&&*s!='.'){
        getnext(s);
        int len=strlen(s);
        if(len%(len-next[len])==0)
            printf("%d\n",len/(len-next[len]));
        else
            printf("1\n");
    }
    return 0;
}