POJ - 1961 Period(水)
来源:互联网 发布:ubuntu 主分区 编辑:程序博客网 时间:2024/06/05 13:23
Period
Time Limit: 3000MS Memory Limit: 30000KB 64bit IO Format: %I64d & %I64u
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 A K ,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
#include<iostream>#include<cstring>using namespace std;const long long int MAXN = 1000100;char s[MAXN];long long int nextl[MAXN];void get_nextlen(long long int n){long long int i = 0, j = -1;nextl[0] = -1;while (i <= n){if (j == -1 || s[i] == s[j]){j++; i++;nextl[i] = j;}else j = nextl[j];}return;}int main(){long long int n;long long casen = 1;while (cin >> n&&n){cin >> s;cout << "Test case #" << casen << endl;casen++;long long int len = strlen(s);get_nextlen(len);for (long long int l = 2; l <= len; l++){long long int zhouqi;if (nextl[l] * 2 < l) zhouqi = 1;else{if (l % (l - nextl[l]) == 0) zhouqi = l / (l - nextl[l]);else zhouqi = 1;}if (zhouqi > 1)cout << l << " " << zhouqi << endl;}cout << endl;}}
0 0
- POJ - 1961 Period(水)
- 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 Period(KMP)
- POJ 1961 Period(KMP)
- POJ 1961Period (KMP)
- poj 1961 Period(kmp)
- Poj-1961 Period(next数组应用)
- Period (poj 1961&&hdu 1358)KMP
- POJ 1961 Period(kmp循环节)
- POJ 1961 && HDU 1358 Period(kmp)
- poj 1961 Period(KMP求周期)
- POJ 1961 Period
- poj 1961 Period
- iOS开发中的核心动画-Core Animation-
- 在MyEclipse中配置tomcat和简单web平台搭建调试
- 单链表
- NSArray输出到控制台中文乱码解决方
- linux epoll 练习(服务器端)
- POJ - 1961 Period(水)
- 夜深,入睡
- leetcode_num165_Compare Version numbers
- C++ STL 使用总结
- Boost.Asio基础(五) 异步编程初探
- linux 分析进程占用CPU过高
- Maven 项目不打包 *.hbm.xml 映射文件
- SlidingMenu常用属性设置记录
- poj 3390 Print Words in Lines 动态规划