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.
作者: CHEN, Yue
单位: 浙江大学
时间限制: 100 ms
内存限制: 64 MB
代码长度限制: 16 KB
这题很巧妙,用个bool 函数很快就搞定了,好经典!而且值得注意的是,bool数组要默认是false,我试了一下,如果是默认true,就啥也输出不了...还是值得研究的!
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <vector>
using namespace std;
const int maxn = 1e4 + 5;
bool a[maxn] = {false};
char s1[maxn],s2[maxn];
int main()
{
cin.getline(s1, maxn);
cin.getline(s2, maxn);
for(int i = 0;i < strlen(s2);i++)
a[s2[i]] = true;
for(int i = 0;i < strlen(s1);i++)
{
if(a[s1[i]] == false)
printf("%c",s1[i]);
}
printf("\n");
return 0;
}