[POJ 2406]Power Strings[KMP]

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

真·skysys

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

阅读量518

点赞数

CC 4.0 BY-SA版权

分类专栏：编程语言算法与数学文章标签： poj kmp

请明确标注出处

本文链接：https://blog.csdn.net/qq_33583069/article/details/51933431

算法与数学同时被 2 个专栏收录

469 篇文章 ¥29.90 ¥99.00

订阅专栏

超级会员免费看

编程语言

128 篇文章

订阅专栏

该博客介绍了如何利用KMP算法解决找出给定字符串S的最小循环节的问题。通过分析KMP算法中next数组的含义，确定当n%（n-next[n]）==0时存在重复连续子串，长度为n-next[n]，从而找到循环节的长度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

Hint
This problem has huge