Power Strings
Time Limit : 6000/3000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)
Total Submission(s) : 141 Accepted Submission(s) : 52
Problem 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
Source
PKU
//公式真的不会,参考代码如下:
#include<stdio.h>
#include<string.h>
const int len=1000010;
int len1;
char str[len];
int p[len];
void getp()
{
int i=0,j=-1;
p[i]=j;
while(i<len1){
if(j==-1||str[i]==str[j]){
i++,j++;
p[i]=j;
}
else
j=p[j];}
if(i%(i-p[i])==0&&p[i]!=0)
printf("%d\n",i/(i-p[i]));
else
printf("1\n");
}
int main(){
while(scanf("%s",str)!=EOF)
{ if(strcmp(str,".")==0)
break;
len1=strlen(str);
getp();
}
return 0;
}