1050. String Subtraction (20)
时间限制 100 ms 内存限制 65536 kB 代码长度限制 16000 B
判题程序 Standard 作者 CHEN, Yue
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 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 S1 - S2 in one line.
Sample Input:
They are students.
aeiou
Sample Output:
Thy r stdnts.
#include <iostream>
#include <fstream>
#include <string>
using namespace std;
const int MaxN = 200;
int main()
{
#ifdef _DEBUG
ifstream cin("data.txt");
#endif // _DEBUG
string str, substr;
while (getline(cin,str))
{
getline(cin, substr);
bool flag[MaxN] = { false };
for (int i = 0, size = substr.size(); i < size; ++i)
flag[substr[i]] = true;
for (int i = 0, size = str.size(); i < size; ++i)
if (!flag[str[i]])
printf("%c",str[i]);
printf("\n");
}
#ifdef _DEBUG
cin.close();
system("pause");
#endif // _DEBUG
return 0;
}