简单的KMP。
//模板开始
#include <string>
#include <vector>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <fstream>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include<iomanip>
#define SZ(x) (int(x.size()))
using namespace std;
int toInt(string s){
istringstream sin(s);
int t;
sin>>t;
return t;
}
template<class T> string toString(T x){
ostringstream sout;
sout<<x;
return sout.str();
}
typedef long long int64;
int64 toInt64(string s){
istringstream sin(s);
int64 t;
sin>>t;
return t;
}
template<class T> T gcd(T a, T b){
if(a<0)
return gcd(-a, b);
if(b<0)
return gcd(a, -b);
return (b == 0)? a : gcd(b, a % b);
}
//模板结束(通用部分)
//【练习03】 KMP 1005 剪花布条
#define ifs cin
#define MAX_SIZE 1000005 * 2
void getFail(char* P, int* f)
{
int m = strlen(P);
f[0] = 0;
f[1] = 0;
for(int i = 1; i < m; i++)
{
int j = f[i];
while(j && P[i] != P[j])
{
j = f[j];
}
f[i + 1]=P[i]==P[j]?j+1:0;
}
}
int find(char* T, char*P, int*f)
{
int count = 0;
int n = strlen(T), m = strlen(P);
getFail(P, f);
int j = 0;
for(int i = 0; i < n; i++)
{
while(j && P[j] != T[i])
{
j = f[j];
}
if(P[j] == T[i])
{
j++;
}
if(j == m)
{
count++;
j = 0;
continue;
}
}
return count;
}
int main()
{
//ifstream ifs("shuju.txt", ios::in);
int result;
int n, m;
char* P = new char[MAX_SIZE];
int* f = new int[MAX_SIZE];
char* T = new char[MAX_SIZE];
while(ifs>>T && T[0] != '#')
{
memset(f, 0, MAX_SIZE * sizeof(int));
ifs>>P;
result = find(T, P, f);
cout<<result<<endl;
}
return 0;
}