Codeforces Round 342 (Div. 2)
B
War of the Corporations
Codeforces
1200
原题
← AC →
翻译中…

A long time ago, in a galaxy far far away two giant IT-corporations Pineapple and Gogol continue their fierce competition. Crucial moment is just around the corner: Gogol is ready to release it's new tablet Lastus 3000.

翻译中…

This new device is equipped with specially designed artificial intelligence (AI). Employees of Pineapple did their best to postpone the release of Lastus 3000 as long as possible. Finally, they found out, that the name of the new artificial intelligence is similar to the name of the phone, that Pineapple released 200 years ago. As all rights on its name belong to Pineapple, they stand on changing the name of Gogol's artificial intelligence.

翻译中…

Pineapple insists, that the name of their phone occurs in the name of AI as a substring. Because the name of technology was already printed on all devices, the Gogol's director decided to replace some characters in AI name with "#". As this operation is pretty expensive, you should find the minimum number of characters to replace with "#", such that the name of AI doesn't contain the name of the phone as a substring.

翻译中…

Substring is a continuous subsequence of a string.

翻译中…

Input

翻译中…

The first line of the input contains the name of AI designed by Gogol, its length doesn't exceed $100 000$ characters. Second line contains the name of the phone released by Pineapple 200 years ago, its length doesn't exceed $30$. Both string are non-empty and consist of only small English letters.

翻译中…

Output

翻译中…

Print the minimum number of characters that must be replaced with "#" in order to obtain that the name of the phone doesn't occur in the name of AI as a substring.

翻译中…

Note

翻译中…

In the first sample AI's name may be replaced with "int#llect".

翻译中…

In the second sample Gogol can just keep things as they are.

翻译中…

In the third sample one of the new possible names of AI may be "s#ris#ri".

翻译中…

样例

Input #1
intellect
tell
Output #1
1
InputCopy OutputCopy
Input #2
google
apple
Output #2
0
InputCopy OutputCopy
Input #3
sirisiri
sir
Output #3
2
InputCopy OutputCopy
题目信息
题号
625B
时间限制
1 s
内存限制
256 MB
标签
构造
贪心
字符串

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。