Binary String Matching
来源:互联网 发布:厦门btn广电网络 编辑:程序博客网 时间:2024/06/04 01:28
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.
- 样例输入
31110011101101011100100100100011010110100010101011
- 样例输出
303
- 来源
- 网络
- 上传者
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;}
阅读全文
0 0
- Binary String Matching
- Binary String Matching
- Binary String Matching
- Binary String Matching
- 【Binary String Matching 5】
- acm-Binary String Matching
- Binary String Matching
- 5 Binary String Matching
- 南阳--Binary String Matching
- Binary String Matching
- Binary String Matching
- Binary String Matching
- Binary String Matching
- Binary String Matching
- Binary String Matching
- Binary String Matching
- Binary String Matching
- Binary String Matching
- 技术类博客网站推荐
- FFMPEG官方编译说明链接
- php 解压zip/rar
- CC2640R2F BLE5.0 CC2640R2F软硬件架构概述
- MyEclipse去除网上复制下来的来代码带有的行号
- Binary String Matching
- 动态规划算法-----找零钱问题(求最优解)
- ActiveMQ、RabbitMQ与ZeroMQ等消息队列性能对比
- 荷兰国旗问题
- AAC 文件解析及解码流程
- WCF服务通过 SvcUtil.exe 方式调用,WCF半动态调用
- 服务端指南 | 良好的 API 设计指南
- 代码异味 (Code smells)
- RTL设计指南---verilog