Binary String Matching
来源:互联网 发布:mac有安卓模拟器 编辑:程序博客网 时间:2024/05/24 15:41
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
#include<stdio.h>#include<iostream>#include<string.h>using namespace std;int main(){int n;char a[15],b[1005];cin>>n;while(n--){int sum=0;cin>>a>>b;for(int i=0;i<strlen(b);i++){int temp=1;for(int j=0;j<strlen(a);j++)if(a[j]!=b[i+j])temp=0;sum+=temp;}cout<<sum<<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
- php处理数组的函数
- 迭代加深搜索--埃及分数
- Label的作用是什么?是怎么用的?
- 将echart的官方实例关系图发布到Web工程上
- Django基础
- Binary String Matching
- asp.net网站记录全局错误
- jni小结(Android studio版)
- BFS例题详解
- chromiumwebview裁剪总结
- 白话经典算法系列之十 一道有趣的GOOGLE面试题
- linux系统的搭建
- Java学习笔记整理06
- ThinkPHP5 模板渲染