POJ-1961 Period-KMP前缀串重复次数
2015-08-25 16:23
344 查看
Period
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
Sample Output
Source
Southeastern Europe 2004
Time Limit: 3000MS | Memory Limit: 30000K | |
Total Submissions: 14803 | Accepted: 7054 |
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
Test case #1 2 2 3 3 Test case #2 2 2 6 2 9 3 12 4
Source
Southeastern Europe 2004
/* *Copyright (c)2015,烟台大学计算机与控制工程学院 *All rights reserved. *作 者:单昕昕 *完成日期:2015年8月25日 *版 本 号:v1.0 */ #include <cstdio> #include <cstring> #include <iostream> using namespace std; const int maxw=1000000+10; char a[maxw]; int next[maxw]; int main() { int n,i,t=1; while(cin>>n&&n!=0) { scanf("%s",a); next[0]=-1; next[1]=0; int p=0; printf("Test case #%d\n",t++); for(i=2; i<=n; i++) { while(p>=0&&a[p]!=a[i-1]) p=next[p]; next[i]=++p; int count=i/(i-next[i]); if(i%(i-next[i])==0&&next[i]!=0)//i-next[i]为循环节长度 { printf("%d %d\n",i,count); } } putchar('\n'); } return 0; }
相关文章推荐
- liunx下安装第三方Python(PIP安装)
- 如何用Maven创建web项目(具体步骤)(转载)
- JavaWeb笔记——利用过滤器实现页面静态化
- 实现Bootstrap导航条可点击和鼠标悬停显示下拉菜单
- JavaWeb笔记——利用过滤器实现页面静态化
- HDU 5127 Dogs' Candies【CDQ分治+动态凸包】
- iOS开发系列--音频播放、录音、视频播放、拍照、视频录制
- Tableau如何连接其他电脑上的mysql数据库
- codeforces 309A Morning run 概率
- 针对不遵守GPL行为的正确做法
- 谁在使用我的网站——用户忠诚和价值分析
- win7 资源资源管理器访问FTP站点
- Linux学习:Linux基础命令集(1)
- How to modify linux time
- Android SwipeRefreshLayout 官方下拉刷新控件介绍
- JavaWeb笔记——三大组件之过滤器
- JDBC技术
- android SQLite数据库的增删改查
- 解决单例设计模式中的懒汉设计模式存在线程安全问题(并且在一定程度上提高效率)的一种解决方法
- JavaWeb笔记——三大组件之过滤器