| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 2 초 | 512 MB | 109 | 80 | 76 | 76.000% |
Define a $k$-periodic string as follows:
A string $s$ is $k$-periodic if $|s|$, the length of the string, is a multiple of $k$ and, if you chop the string up into $|s|/k$ substrings of length $k$, then each of those substrings (except the first) is the same as the previous substring, but with its last character moved to the front.
For example, the following string is $3$-periodic:
abccabbcaabc
The above string breaks up into substrings abc, cab, bca, and abc, and each substring (except the first) is a rotation of the previous substring (abc $\rightarrow$ cab, cab $\rightarrow$ bca, bca $\rightarrow$ abc).
Given a string, determine the smallest $k$ for which the string is $k$-periodic.
Input will be a single line containing a string $s$, ($1 \leq |s| \leq 100$), consisting only of lower-case letters.
Print a single line containing an integer denoting the smallest value of $k$ for which the input string is $k$-periodic.
aaaaaaaa
1
abbaabbaabba
2
abcdef
6
abccabbcaabc
3
ICPC > Regionals > North America > Southeast USA Regional > 2016 Southeast USA Regional Programming Contest > Division 1 I번
ICPC > Regionals > North America > Southeast USA Regional > 2016 Southeast USA Regional Programming Contest > Division 2 H번
ICPC > Regionals > North America > Mid-Atlantic Regional > 2016 Mid-Atlantic Regional Programming Contest A번