Power Strings（poj 2406）（kmp）

最新推荐文章于 2022-01-29 11:49:34 发布

punchline_skr

最新推荐文章于 2022-01-29 11:49:34 发布

阅读量115

点赞数

分类专栏： ACM之字符串专题文章标签： kmp

本文链接：https://blog.csdn.net/qq_41061455/article/details/80370127

版权

ACM之字符串专题专栏收录该内容

8 篇文章 0 订阅

订阅专栏

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.

kmp的典型应用，重点考察next数组的使用，利用next数组求最大循环次数（最小周期）。

#include<bits/stdc++.h>
using namespace std;
const int maxn=1e6+5;
int Next[maxn],len;
char a[maxn];
void get_next()
{
    int i=0,j=-1;
    Next[0]=-1;
    while(i<len)
    {
        if(j==-1||a[i]==a[j])
        {
            i++;
            j++;
            Next[i]=j;
        }
        else j=Next[j];
    }
}
int main()
{
    while(scanf("%s",a)==1&&a[0]!='.')
    {
        len=strlen(a);
        get_next();
        if(len%(len-Next[len])==0&&Next[len])//循环序列
            printf("%d\n",len/(len-Next[len]));//循环长度
        else printf("1\n");
    }
    return 0;
}