POJ 2406 Power Strings（KMP求循环次数）

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<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#define N 10000
#define M 1000010
using namespace std;
int nex[M];
char b[M];
int n,m;
void nexx(){
    int k=-1,j=0;
    nex[0]=-1;
    while(j<m){
        if(k==-1||b[j]==b[k]){
            k++;j++;
            if(b[j]!=b[k])nex[j]=k;
            else nex[j]=nex[k];
        }else k=nex[k];
    }
}
int main(){
    while(scanf("%s",b)!=EOF&&b[0]!='.'){
        m=strlen(b);
        nexx();
        int t=m-nex[m];    //t为最小子串长度
        if(m%t==0)t=m/t;   //能整除求循环次数
        else t=1;          //不能则为1
        printf("%d\n",t);
    }
    return 0;
}