POJ 2406 Power Strings

Power Strings

Time Limit: 3000MS

Memory Limit: 65536KB

64bit IO Format: %I64d & %I64u

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

Hint

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

Source

Waterloo local 2002.07.01

</pre><pre name="code" class="cpp">#include<iostream>
#include<string.h>
#include<stdio.h>
#include<cmath>
#include<string.h>
#include<string>
#include<algorithm>

using namespace std;

const int maxn=1000005;
int next[maxn];
char s[maxn];
int len;

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

int main()
{
	while(cin>>s)
	{
		if(s[0]=='.')break;
	    len=strlen(s);
		getnext();
		if(len%(len-next[len])==0)
			cout<<len/(len-next[len])<<endl;
		else cout<<'1'<<endl;
	}
	return 0;
}