题目
Given two strings S 1 S_1 S1 and S 2 S_2 S2, S = S 1 − S 2 S = S_1-S_2 S=S1−S2 is defined to be the remaining string after taking all the characters in S 2 S_2 S2 from S 1 S_1 S1. Your task is simply to calculate S 1 − S 2 S_1-S_2 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 S 1 S_1 S1 and S 2 S_2 S2, respectively. The string lengths of both strings are no more than 1 0 4 10^4 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 S 1 − S 2 S_1-S2 S1−S2 in one line.
Sample Input:
They are students.
aeiou
Sample Output:
Thy r stdnts.
题目大意
在一个字符串中去掉已给出的字符。
代码
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main(){
string str1, str2;
int a[128];
fill(a, a+128, 0);
getline(cin, str1);
getline(cin, str2);
for(int i=0; i<str2.size(); i++)
a[str2[i]]++;
for(int i=0; i<str1.size(); i++)
if(a[str1[i]] == 0)
printf("%c", str1[i]);
printf("\n");
return 0;
}