UVA - 156

//map count()#include<iostream>#include<cstdio>#include<sstream>#include<cmath>#include<cctype>#include<cstring>#include<algorithm>#include<vector>#include<set>#include<map>#include<queue>#include<deque>using namespace std;map<string,int> mp;vector<string> v1,v2;string chg(string s){    for(int i=0;i<s.size();i++)        s[i]=tolower(s[i]);    sort(s.begin(),s.end());    return s;}int main(){    string s;    while(cin>>s&&s[0]!='#'){        v1.push_back(s);        string s1=chg(s);        if(!mp.count(s1))            mp[s1]=0;        mp[s1]++;    }    for(int i=0;i<v1.size();i++)        if(mp[chg(v1[i])]==1)            v2.push_back(v1[i]);    sort(v2.begin(),v2.end());    for(int i=0;i<v2.size();i++)        cout<<v2[i]<<endl;    return 0;}