【START】2015暑期训练——Binary String Matching

<p>Given two strings A and B, whose alphabet consist only &lsquo;0&rsquo; and &lsquo;1&rsquo;. Your task is only to tell how many times does A appear as a substring of B? For example, the text string B is &lsquo;1001110110&rsquo; while the pattern string A is &lsquo;11&rsquo;, you should output 3, because the pattern A appeared at the posit</p> <p></p>

<p>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) &lt;= 10, and the second line gives the string B, length (B) &lt;= 1000. And it is guaranteed that B is always longer than A.</p> <p></p>

<p>For each case, output a single line consist a single integer, tells how many times do B appears as a substring of A.</p> <p></p>