Pro.ID22353 TitlePower Strings Title链接http://10.20.2.8/oj/exercise/problem?problem_id=22353 AC13 Submit42 Ratio30.95% 时间&空间限制描述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: a0 = "" (the empty string) and a(n+1) = a×(an). 输入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. 输出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: a0 = "" (the empty string) and a(n+1) = a×(an). 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 = an for some string a. Sample Input abcd Sample Output 1 Source 样例输入abcd 样例输出1 作者 |
|Archiver|手机版|小黑屋|同和创作矩阵
( 粤ICP备20019636号-1 )
GMT+8, 2025-2-5 00:00 , Processed in 0.046784 second(s), 23 queries .
Powered by Discuz! X3.4 Licensed
© 2001-2017 Comsenz Inc.
