例题5-4 UVa156 Ananagrams（STL：map）

#include<iostream>
#include<string>
#include<cctype>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
map<string, int> cnt;
vector<string> words;

string repr(const 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());		//输出按照字典序，sort可以处理string
for (int i = 0; i < ans.size(); i++)
cout << ans[i] << "\n";
return 0;
}