PAT A1050

1050 String Subtraction (20 分)
Given two strings S
1
​
and S
2
​
, S=S
1
​
−S
2
​
is defined to be the remaining string after taking all the characters in S
2
​
from S
1
​
. Your task is simply to calculate S
1
​
−S
2
​
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
​
and S
2
​
, respectively. The string lengths of both strings are no more than 10
4
. 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
​
in one line.

Sample Input:
They are students.
aeiou
Sample Output:
Thy r stdnts.

#include<cstdio>
#include <iostream>
#include<cstring>
using namespace std;
int main()
{
	bool hashtable[128]={false};
	char s1[10010],s2[10010];
	cin.getline(s1,10010);
	cin.getline(s2,10010);
	int l2=strlen(s2);
	int l1=strlen(s1);
	for(int i=0;i<l2;i++)
	{
		hashtable[s2[i]]=true;
	}
	for(int i=0;i<l1;i++)
	{
		if(!hashtable[s1[i]])
		printf("%c",s1[i]);
	}
	return 0;
}

pat不支持gets
#include
cin.getline(s1,10010);
cin.getline(s2,10010);