pat1050. String Subtraction (20)

1050. String Subtraction (20)

时间限制

10 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

Sample Input:

They are students.
aeiou

Sample Output:

Thy r stdnts.

---

提交代码

 #include<cstdio>
 #include<algorithm>
 #include<iostream>
 #include<cstring>
 #include<queue>
 #include<vector>
 #include<cmath>
 #include<string>
 #include<map>
 #include<set>
 using namespace std;
 bool ha[];//ACSII码范围  0-127
 int main(){
     //freopen("D:\\INPUT.txt","r",stdin);
     string s1,s2,s3;
     getline(cin,s1);
     getline(cin,s2);
     int i;
     for(i=;i<s2.length();i++){
         ha[s2[i]]=true;
     }
     s3="";
     for(i=;i<s1.length();i++){
         if(!ha[s1[i]]){
             s3=s3+s1[i];
         }
     }
     cout<<s3<<endl;
     return ;
 }