入门经典-5.2.4映射：map-113-uva156反片语-string排序，map⭐⭐⭐⭐⭐难度：1

#include<cstdio>
#include<iostream>
#include<map>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;

map<string,int> cnt;
vector<string> words;
string repr(string s){
	for(int i=0;i<s.length();i++){
		s[i]=tolower(s[i]);
	}
	sort(s.begin(),s.end());//string的字母排序 
	return s;
}
int main(){
	string s;
	while(cin>>s){
		if(s[0]=='#')
		break;
		words.push_back(s);
		string r=repr(s);
		if(!cnt.count(r)) cnt[r]=0;//查询不到则初始化为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());//对vector里的string排序 
	for(int i=0;i<ans.size();i++)
	cout<<ans[i]<<endl;
	return 0;
}