nyoj 5 相同字符串

最新推荐文章于 2023-11-04 21:05:09 发布

love超1314的专栏

最新推荐文章于 2023-11-04 21:05:09 发布

阅读量763

点赞数

分类专栏：数据结构

本文链接：https://blog.csdn.net/u013238646/article/details/38683579

版权

数据结构专栏收录该内容

11 篇文章 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;
	scanf("%d",&n);
	while(n--)
	{
		char s[1001],a[11];
		int i,j,count=0;
		scanf("%s%s",a,s);
		for(i=0;i<=strlen(s)-strlen(a);i++)
		{
			if(s[i]==a[0])
			{
				for(j=1;j<strlen(a);j++)
					if(s[i+j]!=a[j])
						break;
					if(j==strlen(a))
						count++;
			}
		}
		printf("%d\n",count);
	}
	return 0;
}