POJ2406 "Power Strings" 题解(KMP算法)

Power Strings

Time Limit: 3000MS Memory Limit: 65536K
Total Submissions: 69758 Accepted: 28735
Description

题目链接;http://poj.org/problem?id=2406

Given two strings a and b we define ab to be their concatenation. For example, if a = “abc” and b = “def” then ab = “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.

#include<stdio.h>
#include<string.h>
using namespace std;
const int maxn = 1e6+10;
char s1[maxn];
int next[maxn];
int cnt;
void GetNext(char *p)
{
	int lenp=strlen(p);
	int k=-1,j=0;
	next[0]=-1;
	while(j<lenp)
	{
		if(k==-1||p[k]==p[j])
		{
			++j;
			++k;
			next[j]=k;
		}
			
		else
			k=next[k];
	}
}
int main()
{
	int length,len;
	while(~scanf("%s",s1))
	{
		if(s1[0]=='.')break;
		len=strlen(s1);
		GetNext(s1);
		length=len-next[len];
		if(len%length==0)
			printf("%d\n",len/length);
		else puts("1");
	}
	return 0;
}