POJ 2406 Power Strings（KMP求最小循环节个数）

Problem 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

Hint

This problem has huge input, use scanf instead of cin to avoid time limit exceed.

 

思路：

KMP求最小循环节个数

如果n%(n-next[n])==0,则存在重复连续子串，最小循环节长度为n-next[n].

K= n/(n-f[n]) 即为所求的循环节个数.

 

代码：

#include <iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
const int MAXN=1000000+100;
char P[MAXN];
int f[MAXN];
int m;
void getFail(char *P,int *f)
{
    f[0]=f[1]=0;
    for(int i=1;i<m;i++)
    {
        int j=f[i];
        while(j && P[i]!=P[j]) j=f[j];
        f[i+1]=(P[i]==P[j])?j+1:0;
    }
}
int main()
{
    while(scanf("%s",P)==1)
    {
        m=strlen(P);
        if(m==1 && P[0]=='.')
            break;
        getFail(P,f);
        if(m%(m-f[m])==0)printf("%d\n",m/(m-f[m]));
        else printf("1\n");
    }
    return 0;
}