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.

样例输入

3
11
1001110110
101
110010010010001
1010
110100010101011 

样例输出

3
0
3 

//思想比较简单，后来看了一篇博客想起来kmp算法，能是程序性能提高不少

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

int main()
{
	int i,j;
	int n = 0;
	char tStr[1002] = " ",tSubStr[12] = " ";
	int site = 0;
	int count = 0;

	scanf("%d", &n);
	
	while(n--){
		memset(tStr, 0, strlen(tStr));
		memset(tSubStr, 1, strlen(tSubStr));
		count = 0;
		
		scanf("%s", tSubStr);
		scanf("%s", tStr);

		for(i = 0; i  < strlen(tStr); i++){
			site = i;
			for(j = 0; j < strlen(tSubStr); ){
				if(tSubStr[j] == tStr[site]){
					j++,site++;
				} else{
					break;
				}
			}
			if(j == strlen(tSubStr)){
				count++;	
			}
		}
		printf("%d\n", count);

	}
	
	return 0;
}