本文主要是介绍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. 样例输入
-
3 11 1001110110 101 110010010010001 1010 110100010101011
样例输出 -
3 0 3
#include<iostream>
#include<stdio.h>
#include<cstring>
using namespace std;int main()
{int n,m;char a[11],b[1001],*s;scanf("%d",&n);while(n--){m=0;scanf("%s%s",&a,&b);s=strstr(b,a);while(s!=NULL){m++;strcpy(b,s);b[0]=a[0]+1;s=strstr(b,a);}printf("%d\n",m);}
}
这篇关于5 Binary String Matching的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
