[poj2406]Power Strings KMP

Power Strings

Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 999999 Accepted: 99999

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

#include<algorithm>#include<iostream>#include<cstring>#include<cstdio>using namespace std;int nxt[1000005];char s[1000005];void getnxt(){int i = 0, j = -1;int len = strlen(s);nxt[0] = -1;while( i < len ){if( j == -1 || s[i] == s[j] ){i++; j++;nxt[i] = j;} else j = nxt[j];}}int main(){while(~scanf("%s", s) && s[0] != '.'){int ans = 1;getnxt();int len = strlen(s);if( len % (len-nxt[len]) == 0 ){ans = len / (len-nxt[len]);}printf("%d\n", ans);}return 0;}