POJ 1961 Period
来源:互联网 发布:淘宝销售法则有哪些 编辑:程序博客网 时间:2024/06/15 23:58
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 A K ,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.
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
3aaa12aabaabaabaab0
Sample Output
Test case #12 23 3Test case #22 26 29 312 4
kmp求循环节。
#include<stdio.h>#include<string.h>#include<math.h>#include<algorithm>#include<stack>using namespace std;const int maxn = 1000005;int nt[maxn], T = 0, tot, n;char s1[maxn], s2[maxn];int main(){while (scanf("%d%s", &n, s1) == 2 && n){nt[0] = -1;int i;for (i = 0; s1[i]; i++){int j = nt[i];while (j >= 0 && s1[j] != s1[i]) j = nt[j];nt[i + 1] = j + 1;}printf("Test case #%d\n", ++T);for (int i = 1; s1[i - 1]; i++){if (i % (i - nt[i])) tot = 1;else tot = i / (i - nt[i]);if (tot > 1)printf("%d %d\n", i, tot);}printf("\n");}return 0;}
0 0
- POJ 1961 Period
- poj 1961 Period
- POJ 1961 Period
- poj 1961 Period
- poj 1961:Period (KMP)
- POJ-1961 Period
- poj 1961 Period
- POJ 1961 - Period
- poj 1961 Period
- poj 1961Period
- poj 1961 Period (KMP)
- POJ-1961-Period
- POJ 1961 Period
- poj 1961 Period
- poj 1961 Period
- poj 1961 Period---kmp
- POJ 1961 Period
- poj-Period-1961
- canvas 基础
- (创建型模式四)创建者模式
- 关于推送的一点问题
- book--Unix & Linux大学教程
- poj 2454 Jersey Politics
- POJ 1961 Period
- n个大数加法(高精度)
- HDU 2243 考研路茫茫——单词情结 AC自动机 加 矩阵乘法
- send email Java发送邮件
- spring(理论)
- 数据结构与算法《队列》
- Service(二)startService与bindService的区别
- 去掉单独某个类的arc机制
- 单链表-C实现-初级