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循环节
len-nextt[len] 循环节长度
len/(len-nextt[len]) 循环节个数
if(len%(len-nextt[len])==0) 判断当前是否全是回文串
#include <stdio.h>
#include <string.h>
int nextt[10000010];
char s[10000010];
int len;
void getnext()
{
int i=0,j=-1;
nextt[0]=-1;
while(i<len)
{
if(j==-1||s[i]==s[j])
{
nextt[++i]=++j;
}
else j=nextt[j];
}
}
int main()
{
int t,add;
int num;
int cnt=1;
while(~scanf("%s",s)){
if(s[0]=='.')
break;
memset(nextt,0,sizeof(nextt));
len=strlen(s);
getnext();
if(len%(len-nextt[len])==0)
printf("%d\n",len/(len-nextt[len]));
else
printf("1\n");
}
}