acm-Binary String Matching

Binary String Matching

时间限制：3000 ms |  内存限制：65535 KB

难度：3

描述

Given two strings A and B, whose alphabet consist only ‘0’ and ‘1’.Your task is only to tell how many times does A appear as asubstring of B? For example, the text string B is ‘1001110110’while the pattern string A is ‘11’, you should output 3, becausethe pattern A appeared at the posit

输入

The first line consist only one integer N, indicates N casesfollows. In each case, there are two lines, the first line givesthe string A, length (A) <= 10, and the second line gives thestring B, length (B) <= 1000. And it is guaranteed that B isalways longer than A.

输出

For each case, output a single line consist a single integer, tellshow many times do B appears as a substring of A.

样例输入

31110011101101011100100100100011010110100010101011 

样例输出

303 

来源

网络

代码：

#include
#include
#include
using namespace std;
int main()
{
 int n;
 //ifstream cin("test.txt");
 cin>>n;
 while(n--)
 {
  string a,b;
  cin>>a;
  cin>>b;
  int t;
  t=b.find(a,0);
  if(t==-1)
  {
   cout<<"0"<<endl; 
  }
  else
  {
   ints=0;
   int g;
   while(t>=0)
   {
    s++;
    g=t;
    t=b.find(a,g+1); 
   }
   cout<<s<<endl;   
  }
 }
 return 0;
}