题目链接
https://www.patest.cn/contests/gplt/L1-011
AC代码
#include <iostream> #include <cstdio> #include <algorithm> #include <cmath> #include <deque> #include <vector> #include <queue> #include <string> #include <cstring> #include <map> #include <stack> #include <set> #include <cstdlib> #include <ctype.h> #include <numeric> #include <sstream> using namespace std; typedef long long LL; const double PI = 3.14159265358979323846264338327; const double E = 2.718281828459; const double eps = 1e-6; const int MAXN = 0x3f3f3f3f; const int MINN = 0xc0c0c0c0; const int maxn = 1e5 + 5; const int MOD = 1e9 + 7; int main() { string s; getline(cin, s); int len = s.size(); string temp; getline(cin, temp); map <char, int> m; m.clear(); int len_ = temp.size(); for (int i = 0; i < len_; i++) { m[temp[i]] = 1; } for (int i = 0; i < len; i++) { if (m[s[i]] == 0) cout << s[i]; } cout << endl; }转载于:https://www.cnblogs.com/Dup4/p/9433342.html
