Binary String Matching

最新推荐文章于 2024-02-06 22:07:42 发布

loser8101

最新推荐文章于 2024-02-06 22:07:42 发布

阅读量85

点赞数

分类专栏： ACM

本文链接：https://blog.csdn.net/loser8101/article/details/79885177

版权

ACM 专栏收录该内容

14 篇文章 0 订阅

订阅专栏

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<stdio.h>
#include<string.h>
int main() 
{
	int n;
	char a[20],b[1010];
	scanf("%d",&n);
	while(n--)
	{
		int sum=0,flag;
		scanf("%s",a);
		scanf("%s",b);
		for(int i=0;i<strlen(b);i++)
		{
			flag=1;
			for(int j=0;j<strlen(a);j++)
			{
				if(b[i+j]!=a[j])
				flag=0;
			}
			sum+=flag;
		}
		printf("%d\n",sum);		
	}
}