Power Strings
Time Limit: 3000MS | Memory Limit: 65536K | |
Total Submissions: 37521 | Accepted: 15500 |
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
代码:
#include<stdio.h>
#include<string.h>
char s[1000100];
int p[1000100];
int l;
int kmp()
{
int i=0,j=-1;
p[i]=j;
while(i<l)
{
if(j==-1||s[i]==s[j])
{
i++;j++;
p[i]=j;
}
else
j=p[j];
}
i=l-j;
if(l%i==0)
return l/i;
else
return 1;
}
int main()
{
while(scanf("%s",s)!=EOF)
{
if(strcmp(s,".")==0)
{
break;
}
l=strlen(s);
printf("%d\n",kmp());
}
return 0;
}