【kmp】剪花布条

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 const int N = 1e3+10;
 4 char s[N],p[N];
 5 int Next[N],n,m,ans;
 6 void get_Next(){
 7     Next[0] = 0 ;
 8     for(int i=2,j=0 ; i<=m ;i++){
 9         while( j && p[i] != p[j+1] ) j = Next[j] ;
10         if( p[i] == p[j+1] ) j++;
11         Next[i] = j ;
12     }
13 }
14 void KMP(){
15     ans = 0 ;
16     for(int i=1,j=0;i<=n;i++){
17         while( j && s[i] != p[j+1] ) j = Next[j] ;
18         if( s[i] == p[j+1] ) j++;
19         if( j==m ){
20             j = 0;
21             ans ++;
22         }
23     }
24     printf("%d\n",ans);
25 }
26 int main()
27 {
28     while( scanf("%s",s+1) ,strcmp(s+1,"#") ){
29         scanf("%s",p+1);
30         n = strlen( s+1 ) , m = strlen( p+1 );
31         get_Next();
32         KMP();
33     }
34     return 0 ;
35 }