#include<iostream>
#include<string>
using namespace std;
int main(){
string a,b,s;
getline(cin,a);
getline(cin,b);
int hash[1000]{0};
s=a+b;
for(int i=0;i<s.size();i++){
if(hash[s[i]]==0)cout<<s[i];
hash[s[i]]=1;
}
return 0;
}
相关文章
- 11-30pat 乙类 1079 python
- 11-30浙大 PAT 甲级 1079 Total Sales of Supply Chain 最简单的深度优先搜索 DFS
- 11-30P1093奖学金
- 11-30PAT A1143 Lowest Common Ancestor (30 分)
- 11-30PAT 1143 Lowest Common Ancestor (30 分)
- 11-30PAT A1010 Radix [二分]
- 11-30PAT A1042
- 11-30PAT甲级 1055 The World's Richest 排序
- 11-30PAT 1029 Median (合并有序序列)
- 11-30PAT Advanced 1029 Median