poj-2406 Power Strings(kmp-字符串的循环次数)

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

                                                                           Power Strings

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 60403		Accepted: 25003

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

题意：给出一个字符串，输出循环次数，如果不是循坏串，就输出 1即可。

解题思路：记清楚循环串的性质len%(len-next[len])==0,次数是len/(len-next[len]）.

代码：

#include 
#include 
#define N 1000000 
int next[N];

void getnext(char s[])
{
	int j=0;
	int  k=-1;
	int len=strlen(s);
	next[0]=-1;
	while(j