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
判断最小循环节,如果有循环节的话,用长度除以循环节长度就为结果
#include <iostream>
#include<string.h>
#include<algorithm>
#include<cstdio>
#define ll long long
const int mod=1e9+7;
using namespace std;
int next[1000005];
char a[1000005];
int k,j,len;
int main()
{
while(gets(a))
{
if(strcmp(a,".")==0)break;
memset(next,0,sizeof(next));
len=strlen(a);
j=-1;
k=0;
next[0]=-1;
while(k<len)
{
if(j==-1||a[j]==a[k])
{
next[++k] = ++j;
}
else
{
j=next[j];
}
}
int ans=1;
if(len%(len-next[len])==0)
ans=len/(len-next[len]);
printf("%d\n",ans);
}
return 0;
}