문제1304--Power Strings

1304: Power Strings

실행시간 제한: 3 Sec  메모리사용 제한: 512 MB
제출: 49  통과: 19
[제출] [채점기록] [묻고답하기]

문제 설명

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).

입력 설명

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.

출력 설명

For each s you should print the largest n such that s = a^n for some string a.

입력 예시 Copy

abcd
aaaa
ababab
.

출력 예시 Copy

1
4
3

도움

This problem has huge input, use scanf instead of cin to avoid time limit exceed.

출처/분류