# POJ 1961 Period (KMP)

Period
 Time Limit: 3000MS Memory Limit: 30000K Total Submissions: 16635 Accepted: 7999

Description

For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for each i (2 <= i <= N) we want to know the largest K > 1 (if there is one) such that the prefix of S with length i can be written as AK ,that is A concatenated K times, for some string A. Of course, we also want to know the period K.

Input

The input consists of several test cases. Each test case consists of two lines. The first one contains N (2 <= N <= 1 000 000) – the size of the string S.The second line contains the string S. The input file ends with a line, having the
number zero on it.

Output

For each test case, output "Test case #" and the consecutive test case number on a single line; then, for each prefix with length i that has a period K > 1, output the prefix size i and the period K separated by a single space; the prefix sizes must be in increasing order. Print a blank line after each test case.

Sample Input

3
aaa
12
aabaabaabaab
0

Sample Output

Test case #1
2 2
3 3

Test case #2
2 2
6 2
9 3


12 4

题意：给定一个字符串，问这个字符串的所有前缀中，有哪些前缀可以由某个串重复k次组成，并且这个k最大是多少。这个k需要大于1。
分析：对next数组的一种应用；next数组其实保存的就是字符串的相似度；保存的是其前一个字符的前缀和后缀相等的最大值，假如next[i]的值为6，那么它的前一个字符前缀和后缀最多就有6个相等；

#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 1000000 + 10;
char str[maxn];
int next[maxn];
int len;
int cas;
int n;

void getNext()
{
int i = 0, j = -1;
next[0] = -1;
while (i != len){
if (j == -1 || str[i] == str[j]){
next[++i] = ++j;
}
else
j = next[j];
}
}

int main()
{
cas = 0;
while (scanf("%d", &len), len){
scanf("%s", str);
printf("Test case #%d\n", ++cas);
getNext();
for (int i = 2; i <= len; i++){
if (i % (i - next[i]) == 0 && i / (i - next[i]) != 1){
printf("%d %d\n", i, i / (i - next[i]));
}
}
printf("\n");
}
return 0;
}

• 本文已收录于以下专栏：

## POJ-1961(Period)(kmp())

POJ-1961(Period)(kmp()) Description For each prefix of a given string S with N characters ...
• hpulw
• 2016年04月11日 21:44
• 225

## POJ 1961 Period(KMP)

• cccruel
• 2017年08月05日 09:37
• 566

## POJ Period 1961【KMP】

Language: Default Period Time Limit: 3000MS   Memory Limit: 30000K Total Submissions: 14658  ...
• ydd97
• 2015年08月08日 21:09
• 510

## poj 1961 Period(KMP)

http://poj.org/problem?id=1961 题意： 这道题的题意真是晦涩。。。 给你一个字符串，求这个字符串到第i个字符为止的循环节的次数。 比如aabaabaabaab，长度...
• u013081425
• 2014年02月13日 21:30
• 918

## POJ 1961 Period (KMP)

• u013967323
• 2015年02月01日 18:44
• 644

## POJ - 1961 Period(KMP)

Description For each prefix of a given string S with N characters (each character has an ASCII code...
• cherish0222
• 2017年11月22日 22:03
• 57

## poj 1961 Period（kmp）

http://poj.org/problem?id=1961 Period Description For each prefix of a given string S with N cha...
• w144215160044
• 2015年09月28日 19:54
• 209

## POJ 1961 Period （KMP）

Period Time Limit:3000MS Memory Limit:30000KB 64bit IO Format:%lld & %llu SubmitStatusPrac...
• fenghoumilin
• 2016年08月17日 23:58
• 110

## [poj 1961]Period[kmp]

Period Time Limit: 3000MS   Memory Limit: 30000K Total Submissions: 16202   Accept...
• qq_33583069
• 2016年07月18日 11:16
• 266

## POJ - 1961 Period KMP

• ECNU_LZJ
• 2017年08月21日 16:27
• 134

举报原因： 您举报文章：POJ 1961 Period (KMP) 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)