UVa 156 - Ananagrams

156 - Ananagrams

思路：例题5-4

#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <vector>
#include <map>
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(void) {
	int n = 0;
	string s;
	while (cin >> s) {
		if (s[0] == '#') break;
		words.push_back(s);
		string r = repr(s);
		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] << endl;
	return 0;
}