Binary String Matching 简单匹配

http://acm.nyist.net/JudgeOnline/problem.php?pid=5

 

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 a substring of B? For example, the text string B is ‘1001110110’ while the pattern string A is ‘11’, you should output 3, because the pattern A appeared at the posit

输入

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

输出

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

样例输入

3
11
1001110110
101
110010010010001
1010
110100010101011 

样例输出

3
0
3 

#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
    int test;
    scanf("%d",&test);
    while(test--)
    {
        char a[1001];
        char b[1001];
        scanf("%s%s",a,b);
        int a1=strlen(a);
        int a2=strlen(b);
        int sum=0;
        for(int i=0; i<a2; i++)
        {
            int flag=1;
            if(b[i]==a[0])
            {
                for(int j=1; j<a1; j++)
                {
                    if(b[i+j]!=a[j])
                    {
                        flag=0;
                        break;
                    }
                    if(flag==0) break;
                }
                if(flag==1) sum++;
            }
        }
        printf("%d\n",sum);
    }
    return 0;
}