poj 2406 Power Strings KMP的next数组的应用

最新推荐文章于 2022-04-06 20:14:30 发布

dreamnyc

最新推荐文章于 2022-04-06 20:14:30 发布

阅读量395

点赞数 1

分类专栏： kmp扩展 kmp 字符串文章标签：字符串 KMP

本文链接：https://blog.csdn.net/dreamnyc/article/details/51619989

版权

kmp 同时被 3 个专栏收录

2 篇文章 0 订阅

订阅专栏

字符串

2 篇文章 0 订阅

订阅专栏

kmp扩展

1 篇文章 0 订阅

订阅专栏

Power Strings

Description

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数组，在循环的情况下len-next[len]为循环节的长度。

代码如下：

#include<stdio.h>
#include<string.h>
using namespace std;
char p[1000010];
int next[1000010];
void getnext(int len)
{
    int k=-1,j=0;
    next[0]=-1;
    while(j<=len-1)
    {
        if(k==-1||p[j]==p[k])
        {
            j++;
            k++;
            next[j]=k;
        }
        else
            k=next[k];
    }
}
int main()
{
    while(~scanf("%s",p))
    {
        if(strcmp(p,".")==0)
            break;
        int len=strlen(p);
        getnext(len);

        int x=len-next[len];
        if(len%x==0&&len/x>1)
            printf("%d\n",len/x);
        else
            printf("1\n");
    }
}