Binary String Matching

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

描述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<stdio.h>
#include<string.h>
int main()
{
    int n;
    scanf("%d
",&n);
    while(n--)
    {
    char a[15],b[1010];
    int la,lb,p,i,j,count=0;
    scanf("%s",a);
    scanf("%s",b);
    la=strlen(a);
    lb=strlen(b);
    for(i=0;i<lb;i++)
    {
        p=1;
        if(a[0]==b[i])
        {
            for(j=i;j<i+la;j++)
            {
                if(a[j-i]!=b[j])
                {
                    p=0;
                    break;
                }
    
            }
            if(p==1)
            count++;
        }
        
    }
     printf("%d
",count);
    }
return 0;
}