hdu 2087 剪花布条 (kmp，不允许重叠的匹配)

 1/* ***********************************************
 2Author :111qqz
 3Created Time :2016年08月11日 星期四 02时52分44秒
 4File Name :code/hdu/2087.cpp
 5************************************************ */
 6
 7#include <cstdio>
 8#include <cstring>
 9#include <iostream>
10#include <algorithm>
11#include <vector>
12#include <queue>
13#include <stack>
14#include <set>
15#include <map>
16#include <string>
17#include <cmath>
18#include <cstdlib>
19#include <deque>
20#include <ctime>
21#define fst first
22#define sec second
23#define lson l,m,rt<<1
24#define rson m+1,r,rt<<1|1
25#define ms(a,x) memset(a,x,sizeof(a))
26typedef long long LL;
27#define pi pair < int ,int >
28#define MP make_pair
29
30using namespace std;
31const double eps = 1E-8;
32const int dx4[4]={1,0,0,-1};
33const int dy4[4]={0,-1,1,0};
34const int inf = 0x3f3f3f3f;
35const int N=1E3+7;
36char a[N],b[N];
37int nxt[N];
38
39void getnxt(char *s)
40{
41    int i = 0;
42    int j = -1;
43    nxt[0] = -1;
44    int n = strlen(s);
45    while (i<n)
46	if (j==-1||s[i]==s[j]) nxt[++i]=++j;
47	else j = nxt[j];
48}
49int kmp(char *a,char *b)
50{
51    int n = strlen(a);
52    int m = strlen(b);
53    getnxt(b);
54    int i = 0;
55    int j = 0;
56    int cnt = 0 ;
57    while (i<n)
58    {
59	if (j==-1||a[i]==b[j]) i++,j++;
60	else j=nxt[j];
61	if (j==m)
62	{
63	    cnt++;
64	    j=0;  //不允许重叠
65	}
66    }
67    return cnt;
68
69}
70int main()
71{
72	#ifndef  ONLINE_JUDGE 
73	freopen("code/in.txt","r",stdin);
74  #endif
75
76	while (~scanf("%s",a))
77	{
78	    if (a[0]=='#') break;
79	    scanf("%s",b);
80	    int ans = kmp(a,b);
81	    printf("%d\n",ans);
82	}
83
84  #ifndef ONLINE_JUDGE  
85  fclose(stdin);
86  #endif
87    return 0;
88}