Codeforces Round #342 (Div. 2)-B. War of the Corporations(模拟)

最新推荐文章于 2022-08-21 01:05:54 发布

梧桐下的四叶草

最新推荐文章于 2022-08-21 01:05:54 发布

阅读量445

点赞数

分类专栏： codeforces 文章标签： codeforces 模拟

本文链接：https://blog.csdn.net/zsc2014030403015/article/details/50650107

版权

codeforces 专栏收录该内容

123 篇文章 1 订阅

订阅专栏

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.

        Sample test(s) 
      
          input 
        
intellect
tell

          output 
        
1

          input 
        
google
apple

          output 
        
0

          input 
        
sirisiri
sir

          output 
        
2

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".

这题就是找上字符串有多少个与下字符串相同的。

AC代码：

#include<iostream>
#include<functional>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<cstdio>
#include<cmath>
#include<map>
using namespace std;
#define CRL(a) memset(a,0,sizeof(a))
typedef unsigned __int64 LL;
typedef  __int64 ll;
#define CMP bool cmp(const node& a,const node& b){	return a.R<b.R||(a.R==b.R&&a.L<b.L); }
const int T = 503000;
const int mod = 1000000007;


int main()
{
#ifdef zsc
    freopen("input.txt","r",stdin);
#endif

	int n,m,i,j,k;
	
	string s,ss;
	bool flag ;
	while(cin >> s >> ss)
	{
		int len1 = s.size(),len2 = ss.size();
		k = 0;
		for(i=0;i<=len1-len2;++i){
			flag = false;
			for(j=0;j<len2;++j){
				if(s[i+j]!=ss[j]){
					flag = true;
					break;
				}
			}
			if(!flag){
				k++;
				i = i+len2-1;
			}
		}
		printf("%d\n",k);
	}

    return 0;
}