Power Strings
Time Limit:3000MSMemory Limit:65536K
Total Submissions:34601Accepted:14319
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
abcdaaaaababab.
Sample Output
143
Hint
This problem has huge input, use scanf instead of cin to avoid time limit exceed.
Source
AC代码：
#include <cstdio>#include <cstring>#include <algorithm>using namespace std; char str[1000005];int next[1000005];int main() {while(scanf("%s", str) && str[0] != '.') {int i = 0, j = -1, len = strlen(str);next[0] = -1;while(i < len) {if(j == -1 || str[i] == str[j]) next[++i] = ++j;else j = next[j];}if(len % (len – next[len]) == 0) printf("%d\n", len / (len – next[len]));else printf("1\n");}return 0;}
，发光并非太阳的专利，你也可以发光
