当前位置: 代码迷 >> 综合 >> PAT甲级-1050 String Subtraction (20分)
  详细解决方案

PAT甲级-1050 String Subtraction (20分)

热度:100   发布时间:2023-09-26 23:23:53.0

点击链接PAT甲级-AC全解汇总

题目:
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<bits/stdc++.h>
using namespace std;int main(){
    string str;getline(cin,str);set<char>ignore;char c;while((c=getchar())!='\n') ignore.insert(c);for(int i=0;i<str.length();i++)    if(ignore.find(str[i])==ignore.end())cout<<str[i];    return 0;
}
  相关解决方案