156 - Ananagrams

#include <iostream>#include <vector>#include <string>#include <algorithm>#include <map>using namespace std;int main(){string s;vector<string> words;map<string,int> count;while(cin>>s){if(s[0] == '#')break;words.push_back(s);for(int i=0;i<s.size();i++){s[i] = tolower(s[i]);}sort(s.begin(),s.end());count[s]++;}vector<string> ans;for(int i=0;i<words.size();i++){s = words[i];for(int j=0;j<s.size();j++){s[j] = tolower(s[j]);}sort(s.begin(),s.end());if(count[s] == 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;}