#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <ctype.h>//isalpha,isdight,toupper
#include <map>
#include <sstream>
typedef long long ll;
using namespace std;
#define inf 0x3f3f3f3f
const int maxn=25;
vector<string>words;
map<string,int>cnt;
string repr(string& s){
string ans=s;
for(int i=0;i<ans.length();i++)
ans[i]=tolower(ans[i]);
sort(ans.begin(),ans.end());
return ans;
}
int main(){
int n=0;
string s;
while(cin>>s){
if(s[0]=='#')break;
words.push_back(s);
string r=repr(s);
if(!cnt.count(r))cnt[r]=0;
cnt[r]++;
}
vector<string>ans;
for(int i=0;i<words.size();i++)
if(cnt[repr(words[i])]==1)ans.push_back(words[i]);
sort(ans.begin(),ans.end());
for(int i=0;i<ans.size();i++){
cout<<ans[i]<<endl;
}
return 0;
}
uva 156
最新推荐文章于 2021-06-13 18:14:14 发布