【POJ2406】Power Strings 中文题意&题解&代码（C++）

最新推荐文章于 2022-01-29 11:49:34 发布

deritt

最新推荐文章于 2022-01-29 11:49:34 发布

阅读量2.2k

点赞数 1

分类专栏： oi之路文章标签： poj kmp 字符串循环节

本文链接：https://blog.csdn.net/DERITt/article/details/50765974

版权

博客介绍了如何使用KMP算法解决POJ2406 Power Strings问题，该问题要求找到字符串的最短循环节。通过分析KMP中的next数组性质，可以确定字符串是否存在循环节并输出其长度。文章提供了详细的题解思路和代码实现。

摘要由CSDN通过智能技术生成

Power Strings

Time Limit: 3000MS Memory Limit: 65536K

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

Hin