Baron the tallyman watches over the wheat plains of Amberfield's stores of scrolls. A careful computation stands between order and chaos. Task: Count how many times string t occurs inside s (occurrences may overlap). Input format: Two lines: string s, then pattern t. Output format: Print the occurrence count. Constraints: 1 <= |t| <= |s| <= 177; lowercase letters.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= |t| <= |s| <= 177; lowercase letters.
