Power Strings （KMP & next数的运用）

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.

循环节长度 = 前i个字符的个数 - next[i]

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxm = 1e6 + 5;
char s[maxm];
int nex[maxm],len;

void getnext()
{
	int j = 0;
	int i = 1;
	nex[0] = 0;
	while (i<len)
	{
		if (s[i]==s[j])
		{
			j++;
			nex[i] = j;
			i++;
		}
		else if (j==0)
			i++;
		else
			j = nex[j-1];
	}
}

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