POJ -2406 Power Strings（循环节，kmp专题）

A - Power Strings

Time Limit:3000MS     Memory Limit:65536KB     64bit IO Format:%lld & %llu

Submit  Status

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

思路：KMP，next表示模式串如果第i位(设str[0]为第0位)与文本串第j位不匹配则要回到第next[i]位继续与文本串第j位匹配。则模式串第1位到next[n]与模式串第n-next[n]位到n位是匹配的。所以思路和上面一样，如果n%（n-next[n]）==0,则存在重复连续子串，长度为n-next[n]。

例如：a    b    a    b    a    b

next:-1   0    0    1    2    3    4

next[n]==4,代表着，前缀abab与后缀abab相等的最长长度，这说明，ab这两个字母为一个循环节，长度=n-next[n];

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<limits.h>
#include<math.h>
#include<algorithm>
using namespace std;
char str[1000005];
int n,m,p[1000005];
void print()
{
	p[1]=0;
	int i,j=0;
	for(i=2;i<=n;i++)
	{
		while(j>0 && str[j+1]!=str[i])
			j=p[j];
		if(str[j+1]==str[i])
			j++;
		p[i]=j;
	}
}
int  main()
{
	int i,j;
	while(scanf("%s",str+1),str[1]!='.')
	{
		n=strlen(str+1);
		print();
		if(n%(n-p[n])==0)
		printf("%d\n",n/(n-p[n]));
		else
			printf("1\n");
	}
}