poj 1961 Period
来源:互联网 发布:淘宝假发店铺推荐知乎 编辑:程序博客网 时间:2024/06/06 11:35
Period
Time Limit: 3000MS Memory Limit: 30000K
Total Submissions: 16680 Accepted: 8022
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
【分析】
水题一道。求循环节。
【代码】
//poj 1961 Period#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#define fo(i,j,k) for(i=j;i<=k;i++)using namespace std;char s[1000004];int fail[1000004];int main(){ int i,j,n,t=0; while(scanf("%d",&n) && n) { scanf("%s",s+1); printf("Test case #%d\n",++t); j=0; fo(i,2,n) { while(s[j+1]!=s[i] && j) j=fail[j]; if(s[j+1]==s[i]) j++; fail[i]=j; if(fail[i] && (i%(i-fail[i])==0)) printf("%d %d\n",i,i/(i-fail[i])); } printf("\n"); } return 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
- ARC下OC对象和CF对象之间的桥接(bridge)
- POJ 2075 Tangled in Cables
- Linux-C基础知识学习:C语言作业-输入n,打印n行*,每行*数与当前行数相等
- 基于Android平台的流媒体播放器的设计
- ios app提交之前需要哪几个证书
- poj 1961 Period
- linux&unix find命令
- android布局layout中的一些属性
- scala 学习笔记(三)
- iOS开发之检查更新
- Spring依赖注入概念
- Swift修改tabBarItem选中色和tabBar背景色
- 什么是网络流量劫持?揭秘详解黑客劫持的攻击手段与防御方法 (一)
- 十二.Android数据持久化方法之一——文件保存