PAT甲 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 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.

1、参考了网上的资料PAT中不能使用gets，改用cin.getline
2、遇到第三个数据显示格式错误，问题在第二字符串中可能含有空格，要注意把S1中的空格也删除。
3、使用set的find函数，在集合里查找是否存在

#include<cstdio>
#include<iostream>
#include<set>
#include<cstring>
using namespace std;

int main() {
	char s1[10001];
	char s2[10001];
	bool f[10001],f1=false;
	set<char> s;
	cin.getline(s1,10001);
	cin.getline(s2,10001);
	for (int i = 0; i < strlen(s2); i++) 
		s.insert(s2[i]);
	
	for (int i = 0; i < strlen(s1); i++) {
		if (*s.find(s1[i])==s1[i]) f[i] = false;
		else f[i] = true;
	}
	for (int i = 0; i < strlen(s1); i++) 
		if (f[i]) cout << s1[i];
	
	return 0;
}

欢迎指导和交流！