Uva 156 Ananagrams

#include<iostream>#include<cstdio>#include<string>#include<map>#include<algorithm>#include<vector>#include<queue>#include<cstring>using namespace std;vector<string> result;vector<string> words;bool compare(string &s1,string &s2){return s1<s2;}string small(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;map<string,int> str2int;while(cin>>s){words.push_back(s);if(s[0]=='#')break;s=small(s);if(str2int.count(s)==0)str2int[s]=0;str2int[s]++;}int i;for(i=0;i<words.size();i++){if(str2int[small(words[i])]==1)result.push_back(words[i]);}sort(result.begin(),result.end(),compare);for(i=0;i<result.size();i++){cout<<result[i]<<endl;}return 0;}