Binary String Matching 5 （简单KMP模板题）

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<string.h>int l1,l2,cnt;int p[100010];char a[11],b[1010];int getp(){int i=0,j=-1;p[i]=j;while(i<l1){if(j==-1||a[i]==a[j]){i++;j++;p[i]=j;}elsej=p[j];}}int kmp(){getp();int i=0,j=0;while(i<l2){if(j==-1||b[i]==a[j]){i++;j++;if(j==l1)cnt++;}elsej=p[j];}}int main(){int t;scanf("%d",&t);while(t--){scanf("%s%s",a,b);l1=strlen(a);l2=strlen(b);cnt=0;kmp();printf("%d\n",cnt);}return 0;}