Power Strings POJ 2406【KMP Next的应用】
2015-08-07 16:58
288 查看
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
Sample Output
Hint
This problem has huge input, use scanf instead of cin to avoid time limit exceed.
题意:求子串在源字符串出现的最大次数
总结一下,如果对于next数组中的 i, 符合 i % ( i - next[i] ) == 0 && next[i] != 0 , 则说明字符串循环,而且
循环节长度为: i - next[i]
循环次数为: i / ( i - next[i] )
//算次数不需要next[i] != 0这个条件
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
abcd aaaa ababab .
Sample Output
1 4 3
Hint
This problem has huge input, use scanf instead of cin to avoid time limit exceed.
题意:求子串在源字符串出现的最大次数
总结一下,如果对于next数组中的 i, 符合 i % ( i - next[i] ) == 0 && next[i] != 0 , 则说明字符串循环,而且
循环节长度为: i - next[i]
循环次数为: i / ( i - next[i] )
//算次数不需要next[i] != 0这个条件
#include<cstdio> #include<cstring> #define MAX 1000100 char str[MAX]; int next[MAX]; int len; void Get_Next() { int i=0,j=-1; next[0]=-1; while(i<len) { if(j==-1 || str[i]==str[j]) { ++i,++j; next[i]=j; } else j=next[j]; } } int main() { while(scanf("%s",str),strcmp(str,".")) { len=strlen(str); Get_Next(); if((len)%((len)-next[len])==0) printf("%d\n",(len)/((len)-next[len])); else printf("1\n"); } return 0; }
#include<cstdio> #include<cstring> #define MAX 1000100 char str[MAX]; int next[MAX]; int len; void Get_Next() { int i=0,j=-1; next[0]=-1; while(i<len) { if(j==-1 || str[i]==str[j]) { ++i,++j; next[i]=j; } else j=next[j]; } } int main() { while(scanf("%s",str),strcmp(str,".")) { len=strlen(str); Get_Next(); (len)%((len)-next[len])==0&&next[len]!=0?printf("%d\n",(len)/((len)-next[len])):printf("1\n"); } return 0; }
相关文章推荐
- 开源一个windows下的定时任务框架,简单粗暴好用。
- 用户数据库表状态一类的问题
- selenium webdriver学习-怎么等待页面元素加载完成
- 泛型
- “认知反映测试”——衡量一个人是“在短暂的思考后迅速解决问题”还是“通过一段长反射弧深思熟虑后再做决定”
- NSLog打印日志技巧
- Linux学习笔记
- ng-bind-html在ng-repeat中问题的解决办法
- PHP运行模式
- linux下find命令详解
- HDU 1058
- Google代码规范工具Cpplint的使用
- h264 - I帧 B帧 P帧 IDR帧的关系
- 基数排序算法
- 常用的正则表达式
- 讲解 hashCode() 方法和 equals() 方法的文章(转载)
- HibernateCallback对象 回调方法用来创建gethibernatetemplate没有的方法
- Android+PHP+Mysql实现用户登录
- Google代码规范工具Cpplint的使用
- log4js-Node.js中的日志管理模块使用与封装【转】