PAT甲级——（1084） Broken Keyboard

On a broken keyboard, some of the keys are worn out. So when you type some sentences, the characters corresponding to those keys will not appear on screen.
Now given a string that you are supposed to type, and the string that you actually type out, please list those keys which are for sure worn out.
Input Specification:
Each input file contains one test case. For each case, the 1st line contains the original string, and the 2nd line contains the typed-out string. Each string contains no more than 80 characters which are either English letters [A-Z] (case insensitive), digital numbers [0-9], or _ (representing the space). It is guaranteed that both strings are non-empty.
Output Specification:
For each test case, print in one line the keys that are worn out, in the order of being detected. The English letters must be capitalized. Each worn out key must be printed once only. It is guaranteed that there is at least one worn out key.
Sample Input:
7_This_is_a_test
_hs_s_a_es

Sample Output:
7TI

题意：旧键盘上坏了几个键，于是在敲一段文字的时候，对应的字符旧不会出现。现在给出应该输入的一段文字、以及实际被输入的文字，请你列出肯定坏掉的那些键。

思路：用string中的find函数根据在s2中查找s1的每个字符，查不到并且在ans中也没有，那就将此字符的大写加入ans中。

#include<iostream>
#include<cctype>
#include<string>
using namespace std;
int main() {
	string s1, s2, ans;
	cin >> s1 >> s2;
	for (int i = 0; i < s1.length(); i++) {
		if (s2.find(s1[i]) == string::npos&&ans.find(toupper(s1[i])) == string::npos)
			ans += toupper(s1[i]);
	}
	cout << ans;
	return 0;
}