zoukankan      html  css  js  c++  java
  • nyoj 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

    #include<stdio.h>
    #include<string.h>
    int main()
    {
        int N;
        scanf("%d",&N);
        while(N--)
        {
            int i,j,count=0;
           char a[10],b[1000];
            scanf("%s",&a);
           scanf("%s",&b);
                for(j=0;j<strlen(b);j++)
                {
                    for(i=0;i<strlen(a);i++)
                    if(b[j+i]!=a[i]){i++;break;}
                    if(b[j+i-1]==a[i-1])
    					count++;
                }
    
            printf("%d
    ",count);
        }
        return 0;
    }        
    

      

  • 相关阅读:
    国际组织
    波段
    hhgis驱动
    百度地图格式
    气象数据格式
    汽车用传感器
    无线传感器网络
    【系统软件工程师面试】7. 消息队列
    【ToDo】存储设计概述
    Arthas: Java 动态追踪技术
  • 原文地址:https://www.cnblogs.com/zhangliu/p/7052666.html
Copyright © 2011-2022 走看看