poj 2406 Power Strings. 【kmp】

Time limit

3000 ms

Memory limit

65536 kB

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.

题意：对于给定的字符串，求其字串重复的最大次数。

思路：根据next数组的性质，只需要判断一下 len % (len - next[len]) 是不是为0，如果是的话，那么 len / (len - next[len]) 即是最大的那个n,否则输出1.

#include<iostream>
#include<cstdio>
#include<cstring>
const int maxn = 1e8+10;
using namespace std;
char s[maxn];
int next[maxn];
void get_next()
{
    int i=0,j=-1;
    next[0]=-1;
    int m=strlen(s);
    while(i<=m)
    {
        if(j==-1 || s[i]==s[j])
        {
            i++,j++;
            next[i]=j;
        }
        else
            j=next[j];
    }
}
int main()
{
    while(~scanf("%s",s) && s[0]!= '.')
    {
        get_next();
        int n=strlen(s);
        if(n%(n-next[n]) == 0)
            printf("%d\n",n/(n-next[n]));
        else
            printf("1\n");
    }
    return 0;
}