poj2406--Power Strings(KMP求最小循环节)
来源:互联网 发布:微信群淘宝客机器人 编辑:程序博客网 时间:2024/04/30 08:04
Power Strings
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 33178 Accepted: 13792
Description
Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef". If we think of concatenation as multiplication, exponentiation by a non-negative integer is defined in the normal way: a^0 = "" (the empty string) and a^(n+1) = a*(a^n).
Input
Each test case is a line of input representing s, a string of printable characters. The length of s will be at least 1 and will not exceed 1 million characters. A line containing a period follows the last test case.
Output
For each s you should print the largest n such that s = a^n for some string a.
Sample Input
abcdaaaaababab.
Sample Output
143
Hint
This problem has huge input, use scanf instead of cin to avoid time limit exceed.
Source
Waterloo local 2002.07.01
用next数组求出整个数组的最大前缀,如果整个串是用循环节组成的,那么 n - next[n] 也就是最小循环节,验证最小循环节会被n整出。
#include <cstdio>#include <cstring>#include <algorithm>int next[1100000] ;char str[1100000] ;void getnext(int l){ int j = 0 , k = -1 ; next[0] = -1 ; while(j < l) { if( k == -1 || str[j] == str[k] ) { j++ ; k++ ; next[j] = k ; } else k = next[k] ; }}int main(){ int l , m ; while(scanf("%s", str)!=EOF) { if( str[0] == '.' ) break; l = strlen(str); getnext(l) ; m = next[l]; if( l % (l-m) != 0 ) printf("1\n"); else { m = l / ( l-m ); printf("%d\n", m); } memset(str,0,sizeof(str)); } return 0;}
0 0
- poj2406--Power Strings(KMP求最小循环节)
- [poj2406]Power Strings(kmp求最小循环节)
- (POJ2406)Power Strings <KMP算法求最小循环节>
- poj2406 Power Strings(kmp求最小循环节)
- 【KMP求最小循环节】POJ2406 Power Strings
- poj2406 Power Strings(kmp求循环节)
- 【poj2406】 Power Strings (KMP求循环节)
- poj2406(KMP 求循环节的个数)Power Strings --
- POJ2406-Power Strings(kmp循环节)
- POJ2406 Power Strings(KMP,循环节)
- 【POJ2406】Power Strings(KMP与最小循环节的故事)
- POJ 2406 Power Strings(KMP求最小循环节)
- poj2406——Power Strings(KMP循环节)
- poj2406--Power Strings(kmp:求循环串的次数)
- POJ 2406 Power Strings KMP 求最小循环节
- KMP + 求最小循环节 --- POJ 2406 Power Strings
- 【poj 2406】 Power Strings 【KMP 求最小循环节】
- POJ2406 Power Strings KMP-next数组的循环节
- Git 历险记
- 无聊的黑叔
- [Django]models中定义的choices 字典在页面中显示值
- [无限互联]学员作品:旅游软件“在路上”IOS客户端
- SDUT 1068-Number Steps(数学:直线)
- poj2406--Power Strings(KMP求最小循环节)
- poj 3921 (控制费用的 最小割)
- Struts 2的工作流程
- html使用列表 以及div的布局和table的布局
- HDOJ题目1505 City Game(动态规划)
- Java 学习 第三章 Java核心-继承与多态
- ANDROID L——Material Design详解(视图和阴影)
- struts2的优点
- poj1961--Period(KMP求最小循环节)