1084. Broken Keyboard (20)

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

---

求键盘坏掉的键，输出的如果是字母要求是大写形式。用unordered_set储存第二个字符串的出现的所有字符（如果是小写字母转化成大写字母），然后输出的时候，遍历第一个字符串，如果当前字符（如果是小写字母转化成大写字母）不在上面得到的集合中，说明那个字符打不出来，即键坏了，就输出这个字符，且把这个字符也插入到集合中（为了避免重复输出）。

代码：

#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <vector>
//#include <boost/unordered_set.hpp>
#include <unordered_set>
using namespace std;
//using namespace boost;

int main()
{
	char s[85],t[85];
	scanf("%s",s);
	scanf("%s",t);
	int s_len=strlen(s);
	int t_len=strlen(t);
	unordered_set<char>Set;
	for(int i=0;i<t_len;i++)
	{
		char c=toupper(t[i]);
		Set.insert(c);
	}
	for(int i=0;i<s_len;i++)
	{
		char c=toupper(s[i]);
		if(Set.find(c)==Set.end())
		{
			printf("%c",c);
			Set.insert(c);
		}
	}
}