Binary String Matching
2017-08-03 10:58
162 查看
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
来源网络
上传者
naonao
#include <iostream>
#include <string>
using namespace std;
int main(){
int t;
string a, b;
cin >> t;
while(t--){
cin >> a >> b;
int n = 0;
int index = b.find(a, 0);//返回从0开始找到子串在串中的位置下标
while(index != b.npos){//npos表示不存在
n++;
index = b.find(a, index + 1);
}
cout << n << endl;
}
return 0;
}
相关文章推荐
- nyoj-5-Binary String Matching
- Binary String Matching
- Binary String Matching---KMP算法,再次复习
- NYOJ 5 Binary String Matching 字符串匹配
- nyoj-5-Binary String Matching
- 南阳理工ACM 5Binary String Matching
- Binary String Matching
- nyoj 5 Binary String Matching
- ACM (5) Binary String Matching
- NYOJ 5 Binary String Matching
- NYOJ-5-Binary String Matching
- 南阳oj 5 Binary String Matching
- Binary String Matching
- nyoj5Binary String Matching
- nyoj 5Binary String Matching
- Binary String Matching
- NYOJ题目5---Binary String Matching
- 5 Binary String Matching
- Binary String Matching
- nyoj 5 Binary String Matching(string)