PROGRAMMING:Binary String Matching
###Task description
```
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
```
###Input format:
```
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.
```
###Output format:
```
For each case, output a single line consist a single integer, tells how many times do B appears as a substring of A.
```
###Input example:
```in
three
eleven
one billion one million one hundred and ten thousand one hundred and ten
one hundred and one
one hundred and ten trillion and ten billion ten million ten thousand and one
one thousand and ten
one hundred and ten trillion and one hundred billion ten million one hundred and one thousand and eleven
```
###Output example:
```out
three
0
three
```
###Title Source
Note: this topic is selected from nyoj website http://nyoj.top/problem/5
answer：If there is no answer, please comment
```
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
```
###Input format:
```
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.
```
###Output format:
```
For each case, output a single line consist a single integer, tells how many times do B appears as a substring of A.
```
###Input example:
```in
three
eleven
one billion one million one hundred and ten thousand one hundred and ten
one hundred and one
one hundred and ten trillion and ten billion ten million ten thousand and one
one thousand and ten
one hundred and ten trillion and one hundred billion ten million one hundred and one thousand and eleven
```
###Output example:
```out
three
0
three
```
###Title Source
Note: this topic is selected from nyoj website http://nyoj.top/problem/5
answer：If there is no answer, please comment