【ACM】Binary String Matching详解编程语言

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.