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 43
KMP求next数组运用于算字符串周期
小白上的算周期方法#include<iostream> #include <cstdio> #include <cstdlib> #include <cstring> using namespace std; int next[1000010]; char str[1000010]; int getnext() { int i=0,j=-1; next[0]=-1; while(str[i]) { if(j==-1||str[i]==str[j]) { i++; j++; next[i]=j; } else j=next[j]; }//j是前缀,例如ababab则j指向第二个b int len=strlen(str); int a=len-j; if(len%a==0) return len/a; else return 1; } int main() { while(scanf("%s",str),str[0]!='.') { printf("%d\n", getnext() ); } return 0; }
#include<cstdio> #include<cstring> char str[1000000]; int main() { int i,j,len; while(scanf("%s",str),str[0]!='.') { len=strlen(str); for(i=1;i<=len;i++) { if(len%i==0) { int ok=1; for(j=i;j<len;j++) { if(str[j]!=str[j%i]) { ok=0;break; } } if(ok) { printf("%d\n",len/i);break; } } } } return 0; }