问题 D: 4.5.17 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).

 

输入

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.

 

输出

For each s you should print the largest n such that s = a^n for some string a.

 

样例输入

abcd
aaaa
ababab
.

样例输出

1
4
3

提示

#include<cstdio>
#include<string.h>
#define max 2000002
using namespace std;
long long ne[max];
char s[max];
void kmp()
{
    ne[0]=-1;
    long long i=0,j=-1;
    long long L=strlen(s);
    while(i<L)
    {
        if(j==-1||s[i]==s[j])
        {
            i++;
            j++;
            ne[i]=j;
        }
        else
        j=ne[j];
    }
}
int main()
{
    while(scanf("%s",s)&&s[0]!='.')
    {
        kmp();
        long long L=strlen(s);
        if(L%(L-ne[L])==0)
        {
            printf("%d\n",L/(L-ne[L]));
        }
        else
        printf("1\n");
    }
    return 0;
}