POJ 2406 Power Strings

最新推荐文章于 2022-07-21 20:55:14 发布

ShinyaLicone

最新推荐文章于 2022-07-21 20:55:14 发布

阅读量373

点赞数 1

分类专栏： POJ KMP 文章标签： C++ KMP

本文链接：https://blog.csdn.net/SenyeLicone/article/details/51930939

版权

POJ 同时被 2 个专栏收录

105 篇文章 0 订阅

订阅专栏

KMP

6 篇文章 0 订阅

订阅专栏

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.

Source

Waterloo local 2002.07.01

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

KMP~

这里的字符串是从0开始的，所以求next[i]的时候k要-1~

很巧妙的用了next数组~

（输入字符串s可以不加&~）

#include<cstdio>
#include<cstring>
#define maxn 1000006

int len,k,next[maxn];
char s[maxn];

void g(char u[],int v)
{
	for(int i=1;i<v;i++)
	{
		k=next[i-1];
		while(k>0 && u[i]!=u[k]) k=next[k-1];
		if(u[i]==u[k]) next[i]=k+1;
		else next[i]=0;
	}
}

int main()
{
	scanf("%s",s); 
	while(s[0]!='.')
	{
		len=strlen(s);
		next[0]=0;
		g(s,len);
		if(len%(len-next[len-1])==0) printf("%d\n",len/(len-next[len-1]));
		else printf("1\n");
		scanf("%s",s);
	}
	return 0;
}