PAT1029

还是水题

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
set<char>set1;
set<char>set2;

int main()
{
    string s1,s2;
    cin>>s1>>s2;
    for(int i = 0;i<s2.size();i++)
    {
        if(isalpha(s2[i])) s2[i] = toupper(s2[i]);
        set2.insert(s2[i]);
    }
    for(int i = 0;i<s1.size();i++)
    {
        if(isalpha(s1[i])) s1[i] = toupper(s1[i]);
        if(set2.find(s1[i])==set2.end() && set1.find(s1[i])==set1.end())
        {
            cout<<s1[i];
            set1.insert(s1[i]);
        }
    }

    return 0;
}
/**
7_This_is_a_test
_hs_s_a_es
**/