L - Power Strings（KMP）

Description

Given two strings a and b we define ab to be their concatenation. For example, if a = “abc” and b = “def” then ab = “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
.

Output

1
4
3

Hint

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

思路：

定理：假设S的长度为len，则S存在循环子串，当且仅当，len可以被len - next[len]整除，最短循环子串为S[len - next[len]]

解法：利用KMP算法，求字符串的特征向量next，若len可以被len - next[len]整除，则最大循环次数n为len/(len - next[len])，否则为1。

答案：

#include <bits/stdc++.h>
#define ll long long
const int N = 1e6 + 10;
using namespace std;

char s[N];
int Next[N];

void get_Next(char *str)
{
    int len=strlen(str);
    int i=0;
    int j=-1;
    Next[0]=-1;
    while(i<len)
    {
        if(j==-1||str[i]==str[j])
        {
            Next[++i]=++j;
        }
        else
            j=Next[j];
    }
}

int main()
{
    ios::sync_with_stdio(0);
    while(cin>>s&&s[0]!='.')
    {
        get_Next(s);
        int len=strlen(s);
        if(!(len%(len-Next[len])))
            printf("%d\n",len/(len-Next[len]));
        else
            printf("1\n");
    }
    return 0;
}