【POJ2406】Power Strings

                                             Power Strings

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 59305		Accepted: 24603

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.

 

解析：
       KMP最小循环节。

       用KMP算出next数组，如果说明有解，解为，否则无解输出1。

 

代码：
 

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;

const int Max=1000005;
int n,first[Max];
char ch[Max];

inline void pre()
{
	for(int i=2,j=0;i<=n;i++)
	{
	  while(j&&ch[j+1]!=ch[i]) j=first[j];
	  if(ch[j+1]==ch[i]) j++;
	  first[i]=j;
	}
}

int main()
{
	while(1)
	{
	  scanf("%s",ch+1);
	  if(ch[1]=='.') break;
	  memset(first,0,sizeof(first));
	  n=strlen(ch+1),pre();
	  if(!(n%(n-first[n]))) cout<<n/(n-first[n])<<"\n";
	  else cout<<"1\n"; 
	}
	return 0;
}