POJ - 2406 Power Strings

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-next[n]
          n%(n-next[n])就是最小循环节的最大循环次数。

代码
 

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
char s[1000010];
int next[1000010];//next[i]表示i长度的匹配串所拥有的 最长相同的 前缀后缀的 长度
void get(char s[],int next[],int len)
{
    next[0]=-1;
    int i=0;
    int j=-1;
    while(i<len)
    {
        if(j==-1||s[i]==s[j])// 当前位置匹配
        {
            i++;      //移动到下一位置
            j++;      //匹配个数+1
            next[i]=j;
        }
        else
            j=next[j]; //回溯
    }
}
int main()
{
    while(~scanf("%s",s))
    {
        if(s[0]=='.')
            break;
        memset(next,0,sizeof(next));
        int len=strlen(s);
        get(s,next,len);
        int sum=1;
        if(len%(len-next[len])==0)
            sum=len/(len-next[len]);
        printf("%d\n",sum);
    }
}