1961 Period //KMP
来源:互联网 发布:java数组的长度怎么算 编辑:程序博客网 时间:2024/05/13 16:25
Period
Time Limit: 3000MS Memory Limit: 30000KTotal Submissions: 6003 Accepted: 2548
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
#include<stdio.h>
char s[1000001];
int p[1000001],n;
void init()
{
int j;
p[1]=0;
for(int i=2;i<=n;i++)
{
j=p[i-1];
while(j>0&&s[j+1]!=s[i]) j=p[j];
if(s[j+1]==s[i]) j++;
p[i]=j;
}
}
int main()
{
int cas=1;
while(scanf("%d",&n)!=EOF)
{
if(n==0) break;
printf("Test case #%d/n",cas++);
scanf("%s",s+1);
init();
for(int i=2;i<=n;i++)
{
if(i%(i-p[i])==0&&i/(i-p[i])!=1) printf("%d %d/n",i,i/(i-p[i]));
}
printf("/n");
}
return 0;
}
- 1961 Period //KMP
- poj 1961:Period (KMP)
- poj 1961 Period (KMP)
- poj 1961 Period---kmp
- POJ 1961-Period:KMP
- poj 1961 Period KMP
- poj 1961 Period(KMP)
- Period - POJ 1961 KMP
- POJ 1961 Period (KMP)
- POJ Period 1961【KMP】
- POJ 1961 Period kmp
- poj 1961 Period 【KMP】
- POJ-1961(Period)(kmp())
- [poj 1961]Period[kmp]
- POJ 1961 Period (KMP)
- POJ 1961 Period(KMP)
- |poj 1961|KMP|Period
- Poj-1961-Period-【KMP】
- C++ Builder 6 中 安装TeeChart Pro 6.01
- List中使用remove出错的问题分析
- Google Apps Engine Get Started
- VC++界面编程总结
- 成功日记的第二天
- 1961 Period //KMP
- ACE通信框架的一些例子(包括MFC)
- 利用flex秘密窃取商业网站的Cookie(XSS跨站攻击)-----luodfu
- 使用PHP模拟RTMP客户端发送AMF消息(弹幕发射器)
- VC++2003/2005/2008 调用Mediaplayer的指南
- 工厂模式总述
- Hibernate+Spring+Struts2整合开发中的一个分页显示方案 (转)
- poj 1131 Octal Fractions
- shell脚本重要的常识