POJ——Power Strings

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

Hint

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

Source

Waterloo local 2002.07.01

简单kmp的应用。。

#include<stdio.h>
#include<string.h>

const int maxn=1000010;

int next[maxn];

char str[maxn];
 
void get_next()
{
	next[0]=-1;
	int j=0,k=-1;
	while(str[j]!='\0')
	{
		if(k == -1 || str[k] == str[j])
		{
			j++;
			k++;
			if(str[j] != str[k])
			  next[j]=k;
	        else
	          next[j]=next[k];
		}
		else
		   k=next[k];
	}
}

int main()
{
	while(~scanf("%s",str))
	{
		if(str[0]=='.')
		  break;
        get_next();
        int len=strlen(str);
        if(len%(len-next[len]) == 0 && len/(len-next[len])>1)
           printf("%d\n",len/(len-next[len]));
        else
           printf("1\n");
	} 
	return 0;
}