1050 String Subtraction——PAT甲级

本文主要是介绍1050 String Subtraction——PAT甲级，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

Given two strings S1​ and S2​, S=S1​−S2​ is defined to be the remaining string after taking all the characters in S2​ from S1​. Your task is simply to calculate S1​−S2​ 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 S1​ and S2​, respectively. The string lengths of both strings are no more than 104. 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 S1​−S2​ in one line.

Sample Input:

They are students.
aeiou

Sample Output:

Thy r stdnts.

 solution:

#include<bits/stdc++.h>
using namespace std;
int main()
{string s1,s2;getline(cin,s1);getline(cin,s2);map<char,int>mp;for(auto i:s2){mp[i]++;}for(auto i:s1){if(!mp[i])cout<<i;}
}

这篇关于1050 String Subtraction——PAT甲级的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---