PKU 2406(KMPアルゴリズムの柔軟な応用)
1244 ワード
Power Strings
Time Limit: 3000MS
Memory Limit: 65536K
Total Submissions: 13798
Accepted: 5754
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
Sample Output
Hint
This problem has huge input, use scanf instead of cin to avoid time limit exceed.
#include #include #define maxn 1000005 int next[maxn]; int len; void getnext(char str[]) { next[0] = -1; int i=0; int j=-1; while (i
Time Limit: 3000MS
Memory Limit: 65536K
Total Submissions: 13798
Accepted: 5754
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.
#include