poj2406(KMP 求循环节的个数)Power Strings --
来源:互联网 发布:linux软件下载 编辑:程序博客网 时间:2024/05/18 03:13
Power Strings
Time Limit:3000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uDescription
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.
#include<stdio.h> #include<string.h> char a[1000000]; int p[1000000],n,m,ans; void fail() //p数组构造{ int i=0,j=-1; p[0]=-1; while(i<m){if(a[i]==a[j]||j==-1){j++;i++;p[i]=j;}elsej=p[j];}} int main() { while(scanf("%s", a), strcmp(a, ".")) { m=strlen(a); fail();if(m%(m-p[m]))printf("1\n");elseprintf("%d\n",m/(m-p[m])); } }
0 0
- poj2406(KMP 求循环节的个数)Power Strings --
- poj2406 Power Strings(kmp求循环节)
- 【poj2406】 Power Strings (KMP求循环节)
- poj2406--Power Strings(KMP求最小循环节)
- [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 Power Strings KMP-next数组的循环节
- poj2406——Power Strings(KMP循环节)
- 【POJ2406】Power Strings(KMP与最小循环节的故事)
- poj2406--Power Strings+KMP求周期
- 【KMP】 poj2406 Power Strings
- poj2406 Power Strings-------KMP
- [POJ2406] Power Strings[KMP]
- IBatis分页拦截器
- fidle 域名代替ip访问
- 前端开发--经验浅谈
- poj 3312 水题
- ZZULI 1921: B
- poj2406(KMP 求循环节的个数)Power Strings --
- UVA-133 The Dole Queue
- 【Java】Java基础知识总结
- 每天工作4小时的程序员
- 数据结构实验之图论八:欧拉回路
- Adding Animations之Zooming a View
- SDUT2104图结构练习——判断给定图是否存在合法拓扑序列
- JZOJ3083. 【NOIP2012模拟11.1】塔(加强)
- poj 1837 Balance