20200229 training match L1 - 2 delete the substring in the string (20 points)

Input 2 A string S1 and S2, Request to delete string S1 All substrings that appear in S2, That is, the result string cannot contain S2.

Input format ：

Enter in 2 No more than... Are given in each line 80 In characters 、 End with carriage return 2 Non empty strings , Corresponding S1 and S2.

Output format ：

Output the deletion string in one line S1 All substrings that appear in S2 Result string after .

sample input ：

Tomcat is a male ccatat
cat

sample output ：

Tom is a male

• find(string s) Return string s Starting subscript of the first occurrence , No return found string::npos
• erase(a,b) from a The subscript begins to be deleted , The deletion length is b

#include <bits/stdc++.h>
using namespace std;
int main()
{
    
	string a,b;
	getline(cin,a);
	getline(cin,b);
	while(a.find(b)!=string::npos)
	{
    
		a.erase(a.find(b),b.length());
	}
	cout<<a;
	return 0;
}