1050 String Subtraction (20分)

 

1050 String Subtraction (20分)

Given two strings S​1​​ and S​2​​, S=S​1​​−S​2​​ is defined to be the remaining string after taking all the characters in S​2​​ from S​1​​. Your task is simply to calculate S​1​​−S​2​​ for any given strings. However, it might not be that simple to do it fast.

Input Specification:

Each input file contains one test case. Each case consists of two lines which gives S​1​​ and S​2​​, respectively. The string lengths of both strings are no more than 10​4​​. It is guaranteed that all the characters are visible ASCII codes and white space, and a new line character signals the end of a string.

Output Specification:

For each test case, print S​1​​−S​2​​ in one line.

Sample Input:

They are students.
aeiou

Sample Output:

Thy r stdnts.

#include <iostream>
#include <algorithm>
#include<vector>
#include<map>
#include<string>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<set>
#include<queue>
#include<climits>
using namespace std;
const int maxn= 1000+5;
	string s1,s2;
bool check(char a){
	for(auto j:s2){
		
		if(j==a) return true; 
	}
	
	return false;	
}


int main(){

	getline(cin,s1);
	getline(cin,s2);
	string res;
	for(auto i:s1){
		if(!check(i)){
			
			res+=i;	
		}
	}
	
	
	cout<<res<<endl;
	return 0;	
}

#include <iostream>
#include <algorithm>
#include<vector>
#include<map>
#include<string>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<unordered_set>
#include<queue>
#include<climits>
using namespace std;
const int maxn= 1000+5;
	string s1,s2;



int main(){

	getline(cin,s1);
	getline(cin,s2);
	unordered_set<char>hash;
	for(auto i:s2) hash.insert(i);
	
	string res;
	for(auto i:s1){
		if(!hash.count(i)){
			
			res+=i;	
		}
	}
	
	
	cout<<res<<endl;
	return 0;	
}