codeforces625BWar of the Corporations
2016-02-25 20:19
225 查看
这题就是问你一串字符串里包含几个字串
kmp一下就好了
kmp一下就好了
/* *********************************************** Author :yzkAccepted Created Time :2016/2/7 18:20:38 TASK :ggfly.cpp LANG :C++ ************************************************ */ #include <iostream> #include <cstdio> #include <cstring> #include <algorithm> #include <vector> #include <queue> #include <set> #include <map> #include <string> #include <cmath> #include <cstdlib> #include <ctime> using namespace std; typedef __int64 ll; char s[100050],str[100050]; int nnext[2005]; int pd(char *s1,char *s2){ int n,m,i,j,num=0; n=strlen(s1); m=strlen(s2); i=0,j=-1; memset(nnext,-1,sizeof(nnext)); while(i<m) { if(j==-1 || s2[i]==s2[j]) { i++;j++; nnext[i]=j; } else j=nnext[j]; } i=0;j=0; while(i<n && j<m) { if(j==-1 || s1[i]==s2[j]) { i++,j++; if(j==m) { num++; j=0; } } else j=nnext[j]; } return num; } int main() { int n,m,i,j,ans; scanf("%s",s); scanf("%s",str); printf("%d\n",pd(s,str)); return 0; }
相关文章推荐
- Codeforces Round #197 (Div. 2)
- Codeforces Round #198 (Div. 1)
- Codeforces 405E Codeforces Round #238 (Div. 2)E
- Codeforces 407C Codeforces Round #239 (Div. 1)C
- CodeForces 449A - Jzzhu and Chocolate
- CodeForces 449 B. Jzzhu and Cities
- Codeforces Round #265 (Div. 2)
- Codeforces #310 div2 C. Case of Matryoshkas
- 状态压缩DP codeforces 244 Problem C. The Brand New Function 和 codeforces 165 E. Compatible Numbers
- codeforces 16 Problem E fish
- Codeforces Round332 部分题解
- CodeForces 603A_Alternative Thinking (DP)
- CodeForces 602B_Approximating a Constant Range_DP
- Codeforces round #247 for Div. 2
- Codeforces Round #246 (Div. 2)
- Codeforces #264(div 2)D.Gargari and Permutations
- Codeforces Round #236 (Div. 2)------A,B
- codeforces 257 div2 B
- Codeforces Gym100571A Cursed Query
- Codeforces Gym100342E Minima