POJ2406 KMP算法

最新推荐文章于 2019-06-13 07:58:08 发布

SCUT_Pein

最新推荐文章于 2019-06-13 07:58:08 发布

阅读量776

点赞数

分类专栏：字符串_KMP 文章标签： KMP算法 kmp算法 POJ2406

本文链接：https://blog.csdn.net/scut_pein/article/details/8561160

版权

字符串_KMP 专栏收录该内容

5 篇文章 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

Hint

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

#include <iostream>
#include <string>
#include <cstring>
using namespace std;
#define maxn 1000008
char P[maxn];
int f[maxn];
void getFail()
{
	int n=strlen(P);
	f[0]=f[1]=0;
	for(int i=1;i<n;i++)
	{
		int j=f[i];
		while(j&&P[i]!=P[j])
		{
			j=f[j];
		}
		f[i+1]=P[i]==P[j]?j+1:0;
	}
}
int main()
{
	while(cin>>P&&P[0]!='.')
	{
		getFail();
		int len=strlen(P);
		int r=len-f[len];//如果是周期串，错位部分刚好是一个周期
		if(len%r==0)
		{
			cout<<len/r<<endl;
		}
		else cout<<1<<endl;
	}
	return 0;
}