10298 Power Strings (KMP求字串迴圈節)
阿新 • • 發佈:2018-12-24
Problem D: Power Strings
Given two strings a and b we define a*b to be their concatenation. For example, ifa = "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)Each test case is a line of input representing s, a string of printable characters. For eachs you should print the largest n such that s = a^n for some stringa. 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.
Sample Input
abcd aaaa ababab .
Output for Sample Input
1 4 3