
ZOJ Problem Set  2737
Given a string A which can be represented as A1A2..An (n is the length of A) and a string B which can be represented as B1B2..Bm (m is the length of B), you will need to find the occurrence of B from A. The definition of occurrence is as follows: Input: This problem contains multiple test cases. Each test case contains two lines, which are the strings A and B. The length of A is not greater then 1000 and the length of B is not greater than 100. All the strings are only consist of lowercase letters. Output: Each test should output an integer indicating the occurrence of B from A in a single line. Sample Input:abab ab aaaa a aaaa aaSample Output: 3 4 3 Author: JIN, Tianpeng Source: Zhejiang Provincial Programming Contest 2006, Preliminary 