ny 5 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 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.

样例输入

31110011101101011100100100100011010110100010101011 

样例输出

303 

#include<stdio.h>#include<string.h>int main(){char s1[11];char s2[1010];int t;scanf("%d",&t);while(t--){scanf("%s",s1);int len1=strlen(s1);scanf("%s",s2);int len2=strlen(s2);int falg=0;for(int i=0,j=0;i<len2&&j<len1;){if(s2[i]==s1[j]){++i;++j;{if(j==len1){falg++;i=i-j+1;j=0;}}}else{i=i-j+1;j=0;}}printf("%d\n",falg);}return 0;}