题目1094：String Matching

#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#include <cstring>
#include <stack>
#include <string>
#include <string.h>
#include <stdio.h>
#include <cmath>
#include <map>
#include <functional>
#include <set>
#include <limits.h>
#include <math.h>
#include <ctype.h>
using namespace std;
//1094
string t,p;
int main()
{  
    while(cin>>t>>p)
    {
        int a=t.find(p,0);
        int ant=0;
        while(a!=string::npos)
        {
            ant++;
            a=t.find(p,a+1);
        }
        cout<<ant<<endl;
    }
 
    return 0;
}
/**************************************************************
    Problem: 1094
    User: cust123
    Language: C++
    Result: Accepted
    Time:150 ms
    Memory:3052 kb
****************************************************************/