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.
代码如下:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<stack>
using namespace std;
int next[1000003];
void getNext(char s[],int len){
next[0]=-1;
int k=-1,j=0;
while(j<len){
if(k==-1||s[j]==s[k]){
k++;j++;
if(s[j]!=s[k])next[j]=k;
else next[j]=k;
}
else k=next[k];
}
}
int main(){
char s[1000003];
while(scanf("%s",s)!=EOF){
if(s[0]=='.')break;
int len=strlen(s);
getNext(s,len);
int ans=1;
if(len%(len-next[len])==0){
ans=len/(len-next[len]);
}
printf("%d\n",ans);
}
}