1050 String Subtraction (20 分)

1050 String Subtraction (20 分)

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 1. 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.

Sample Output:

Thy r stdnts.


 1 #include <bits/stdc++.h>
 3 using namespace std;
 4 string s, ss;
 5 int vis[500];
 6 int main(){
 7     getline(cin, s);
 8     getline(cin, ss);
 9     for(int i = 0; i < ss.length(); i++)
10         vis[ss[i]] = 1;
11     for(int i = 0; i < s.length(); i++)
12         if(!vis[s[i]]){
13             cout <<s[i];
14         }
15     cout << endl;
17     return 0;
18 }