2018_1_31_Power Strings_可能的生成元_枚举长度

Power Strings

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 53758		Accepted: 22390

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

#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;

const int N=1e6+8;
char s[N];

int main(){
	int n,m;
	while(gets(s)){
		if(!strcmp(s,"."))return 0;
		n=m=strlen(s);
		int i,j;
		for(i=2;i<=n;i++){
			while(n%i==0){
				n/=i;
				for(j=0;j<m-m/i&&s[j]==s[j+m/i];j++);
				if(j==m-m/i)m/=i;
			}
		}
		cout<<strlen(s)/m<<endl;
	}
    return 0;
}