poj-1961-Period
2016-03-18 19:59
435 查看
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 thenumber 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
3aaa
12
aabaabaabaab
0
Sample Output
Test case #12 2
3 3
Test case #2
2 2
6 2
9 3
12 4
题意:对于一个字符串s,查找长度为i的前缀s’,满足s’=AK,即s’有K个连续的A组成,其中K>1
想做明白这道题,需要先看poj 2406
两道题类似,这道题比那道题难一些
#include <iostream> #include <cstdio> #include <cstring> #include <cstdlib> #define N 1000010 using namespace std; int next ; char str ; void kmp_pre(int len){ int i, j; i = 0; j = next[0] = -1; while(i < len){ while(j != -1 && str[i] != str[j]) j = next[j]; next[++i] = ++j; } } int main(){ #ifndef ONLINE_JUDGE freopen("1.txt", "r", stdin); #endif int n, cas = 1, t; while(scanf("%d", &n)){ if (!n) break; scanf("%s", str); kmp_pre(n); printf("Test case #%d\n", cas++); for (int i = 1; i <= n; i++){ t = i - next[i]; if (i%t == 0 && i != t){ printf("%d %d\n", i, i/t); } } printf("\n"); } return 0; }
相关文章推荐
- Leetcode:303. Range Sum Query - Immutable(JAVA)
- 24. Swap Nodes in Pairs
- 基于TCP协议的Socket编程,实现文件的上传
- iOS获取系统短信,发送指定短信内容
- Constructing Roads
- iOS中frame和bounds的区别
- 找出导致Mysql机器IO过高的SQL
- 应用程序调试工具gdb,王明学learn
- 使用库函数API和C代码中嵌入汇编代码两种方式使用同一个系统调用
- R系列之一 ----逻辑回归
- 深入理解Java回收机制
- linux 从一台机器复制文件到另一台linux机器上去
- 【机房重构】——报表
- iOSDay10之OC类和对象
- IT十八掌作业_java基础第十天_集合
- [数学] BZOJ3142 [Hnoi2013]数列
- bzoj3620 似乎在梦中见过的样子 kmp暴力
- RHEL 7.0 yum源
- 89.数字三角形
- Codeforces Beta Round #4 (Div. 2 Only) D. Mysterious Present 记忆化搜索