1084. Broken Keyboard (20) "String Manipulation"--pat (Advanced level) practise

Topic Information 1084. Broken Keyboard (a)

Time limit of MS
Memory Limit 65536 KB
Code length limit 16000 B
On a broken keyboard, some of the keys is worn out. If you are type some sentences, the characters corresponding to those keys won't appear on screen.

Now given a string of you is supposed to type, and the string is actually type out, please list those keys which Is for sure worn out.

Input Specification:

Each input file contains the 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 characters which is either 中文版 letters [a-z] (case insensitive), digital numbers [0-9], or "_" (representing the space). It is guaranteed this both strings is non-empty.

Output Specification:

For each test case, print in one line the keys is worn out, in the order of being detected. The Chinese letters must be capitalized. Each worn out key must is printed once only. It is guaranteed this there is at the least one worn out key.

Sample Input:
7_this_is_a_test
_hs_s_a_es
Sample Output:
7TI

Thinking of solving problems

Water problem

AC Code

#include <cstdio>#include <cstring>#include <set>#include <cctype>using namespace STD;intMain () {Chars[ -], a[ -], r[ -]; Set<char>Stscanf("%s%s", S, a);intLen =strlen(s), CNT =0; for(inti =0; i < Len; ++i) {if(NULL = =STRCHR(A, s[i])) {if(St.insert (ToUpper(S[i])). Second) {r[cnt++] =ToUpper(S[i]); }        }    } for(inti =0; I < CNT; ++i) {Putchar(R[i]); }return 0;}

1084. Broken Keyboard (20) "String Manipulation"--pat (Advanced level) practise