ACM UVA-156 Ananagrams

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;
map<string, int> cnt;

string repr(const string& s)
{
	string ans = s;
	for(int i = 0; i < s.length(); i++)
		ans[i] = tolower(ans[i]);
	sort(ans.begin(), ans.end());
	return ans;
}

int main()
{
	vector<string> words;
	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());
	for(int i = 0; i < ans.size(); i++)
		cout << ans[i] << "\n";
	return 0;
}

学会用map，熟练vectors的push_back函数

第一次：8.15