# 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

#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;
}

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

## Kmp找字符串循环节——Period ( POJ 1961 )

• FeBr2
• 2016-07-15 15:09
• 713

## Period POJ - 1961（kmp求最大周期，最小循环节）

For each prefix of a given string S with N characters (each character has an ASCII code between 97 a...

## 【KMP】 poj1961 Period

Period http://poj.org/problem?id=1961 Description For each prefix of a given string S wit...

## POJ 1961 Period KMP 最小循环节

Period Time Limit: 3000MS   Memory Limit: 30000K Total Submissions: 11771   Accept...

## POJ-1961 Period-KMP前缀串重复次数

Period Time Limit: 3000MS   Memory Limit: 30000K Total Submissions: 14803   Accepted: 7054 ...

## poj1961 Period(KMP)

C - Period Crawling in process... Crawling failed Time Limit:3000MS     Memory Limit:30000KB    ...

举报原因： 您举报文章：深度学习：神经网络中的前向传播和反向传播算法推导 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)