poj1961 & hdu 1358 Period(KMP)
来源:互联网 发布:emule端口测试失败 编辑:程序博客网 时间:2024/05/21 14:23
poj 题目链接:http://poj.org/problem?id=1961
hdu题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1358
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.
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
Source
Southeastern Europe 2004
题意:
给出一个字符串,求这个字符串到第i个字符为止的循环节的次数。
比如aabaabaabaab,长度为12.到第二个a时,a出现2次,输出2.到第二个b时,aab出现了2次,输出2.到第三个b时,aab出现3次,输出3.到第四个b时,aab出现4次,输出4.
代码如下:
#include<cstdio>#include<cstring>#define N 1000017int next[N];int len;void getnext(char T[]){ int i = 0, j = -1; next[0] = -1; while(i < len) { if(j == -1 || T[i] == T[j]) { i++; j++; next[i] = j; } else j = next[j]; }}int main(){ char s[N]; int cas = 0; int length; while(scanf("%d", &len) && len) { scanf("%s", s); getnext(s); printf("Test case #%d\n", ++cas); for(int i = 1; i <= len; i++) { length = i - next[i];//循环节的长度 if(i != length && i % length == 0)//如果有多个循环 printf("%d %d\n", i, i / length); } printf("\n"); } return 0;}
1 0
- poj1961 & hdu 1358 Period(KMP)
- [POJ1961]Period(KMP)
- poj1961—Period(kmp周期性质)
- 【KMP】 poj1961 Period
- poj1961 Period----KMP
- poj1961 Period (KMP)
- KMP POJ1961 Period
- poj1961 Period(KMP)
- POJ1961 Period(KMP)
- hdu 1358 Period(KMP)
- hdu 1358 Period(KMP)
- HDU 1358 Period(KMP)
- HDU 1358 Period(kmp)
- HDU - 1358 - Period (KMP)
- HDU 1358 Period (KMP)
- hdu 1358 Period(KMP)
- 【hdu 1358】Period(kmp)
- HDU 1358 Period(KMP)
- 网络处理2-异步POST请求和同步请求
- hdu 2082 找单词
- tomcat 内存
- 每天一个了linux库函数——opendir()
- OAF学习笔记-JAVA Entity Object 之 Create data(深入EO系列)
- poj1961 & hdu 1358 Period(KMP)
- Sublime Text中如何运行Java
- Angular API
- Matlab零碎知识
- 静态库.a合并 和 .a文件上传到svn
- BZOJ 1691: [Usaco2007 Dec]挑剔的美食家
- opencl(1)
- Android sdk content loader 0%的解决方案
- mtk android lcm调试