Power Strings poj2406 (kmp 进阶 next数组使用)
2017-08-12 15:04
267 查看
[align=center]Power Strings[/align]
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.
Time Limit: 3000MS | Memory Limit: 65536K | |
Total Submissions: 46647 | Accepted: 19516 |
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.
#include <algorithm> #include <iostream> #include <cstring> #include <iomanip> #include <string> #include <cstdio> #include <cmath> #include <map> using namespace std; #define For(i,a,b) for(i=a;i<=b;i++) #define _For(i,a,b) for(i=b;i>=a;i--) #define Out(x) cout<<x<<endl #define Outdouble(x,a) cout<<fixed<<setprecision(a)<<1.0*x<<endl #define pf printf #define sf scanf #define mset(arr,num) memset(arr,num,sizeof(arr)) #define ll long long const ll inf = 550; /// #define ok std::ios::sync_with_stdio(0) #pragma comment(linker, "/STACK:102400000,102400000") // #define debug #if defined (debug) ---check--- #endif /// ^_^ ^_^ ^_^ ^_^ ^_^ ^_^ ^_^ ^_^ ^_^ ^_^ ^_^ ^_^ ^_^ /// int next[1000100]; string s; void get_next() { int l = s.length(); int i=0,j=-1; next[i] = j; while(i < l) { if(j == -1||s[i]==s[j]) { i++; j++; //next[i] = j; if(s[i]!=s[j]) { next[i] = j; } else { next[i]=next[j]; } ///better } else { j = next[j]; } } } int main() { int i,num,n; while(cin>>s) { if(s[0] == '.') { return 0; } int len = s.length(); get_next(); if(len%(len-next[len]) == 0) { cout<<len/(len-next[len])<<endl; } else { Out(1); } } return 0; }
相关文章推荐
- Period poj1961(kmp 进阶 next数组使用)
- hdu3746(KMP next数组使用)
- (KMP 1.4)hdu 3746 Cyclic Nacklace(使用next数组来求循环节的长度——求一个字符串需要添加多少个字符才能使该字符串的循环节的个数>=2)
- (KMP 1.5)hdu 1358 Period(使用next数组来求最小循环节——求到第i个字符的循环节数)
- KMP模式匹配算法之next数组解析
- HDU 2594 Simpsons’ Hidden Talents(KMP,next数组的应用)
- hdu1358 KMP中next数组的应用
- 【博客地址】:KMP字符串匹配算法与next数组
- 直接写出KMP中next数组(附 改良版next)
- kmp的next数组的运用(求字符串的最小循环节)
- POJ_2752_KMP-next数组的应用
- 计算KMP模式匹配算法中next数组的代码分析及改进型KMP算法中nextval数组代码分析
- zoj3587 Marlon's String(next 数组和kmp)
- HDOJ1358 Period 【KMP next数组应用】
- poj2752Seek the Name, Seek the Fame(kmp简单变形,next数组)
- hdu3746(KMP:next数组应用)
- poj1961-kmp的next数组的简单应用(2)
- 【经典算法】——KMP,深入讲解next数组的求解
- POJ - 2752 Seek the Name, Seek the Fame(KMP next数组的理解)
- KMPnext数组循环节理解 HDU1358