poj 1961 Period
来源:互联网 发布:绿毒越狱软件 编辑:程序博客网 时间:2024/05/22 05:00
题目链接
Period
Period
Time Limit: 3000MS Memory Limit: 30000KTotal Submissions: 13185 Accepted: 6188
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
KMP简单水果。。判断前缀串是否包含循环节,且前缀串不能等于循环节。。
代码:
KMP简单水果。。判断前缀串是否包含循环节,且前缀串不能等于循环节。。
代码:
#include<stdio.h>#include<string.h>#include<queue>#include<stdlib.h>#include<algorithm>using namespace std;const int maxn=1000005;char s[maxn];int next[maxn];int n;void get_next(char *p,int *next){ int i=0,j=-1; next[0]=-1; while(i<n) { if(j==-1||s[i]==s[j]) { i++; j++; next[i]=j; } else j=next[j]; }}int main(){ //freopen("in.txt","r",stdin); int ca=1; while(scanf("%d",&n)!=EOF) { if(n==0) break; memset(next,0,sizeof(next)); getchar(); gets(s); get_next(s,next); printf("Test case #%d\n",ca++); for(int i=2;i<=n;i++) { int tmp=i-next[i]; if((i%tmp==0)&&(tmp!=i)) { printf("%d %d\n",i,i/tmp); } } 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
- Hive的数据存储模式
- JavaScript脚本放在哪里用户体验好
- 中西医颅神经平衡疗法的治疗原理
- NULL,'0','\0',0的区别
- 在eclipse中配置hadoop插件并尝试运行一个小程序
- poj 1961 Period
- 单源最短路径问题
- javascript学习(二)javascript常见问题总结
- Spring DataSource 数据源
- Java web 开发笔记 第五章 Servlet编程四
- javascript学习(一)构建自己的JS库
- Android:读写指定位置文件
- POJ1837:Balance(01背包)
- Codeforces 454B. Little Pony and Sort by Shift