UVA_156: Ananagrams

Description

Most crossword puzzle fans are used to anagrams--groupsof words with the same letters in different orders--for exampleOPTS, SPOT, STOP, POTS and POST. Some words however do not have thisattribute, no matter how you rearrange their letters, you cannot formanother word. Such words are called ananagrams, an example isQUIZ.Obviously such definitions depend on the domain within which we areworking; you might think that ATHENE is an ananagram, whereas anychemist would quickly produce ETHANE. One possible domain would be theentire English language, but this could lead to some problems. Onecould restrict the domain to, say, Music, in which case SCALE becomesa relative ananagram (LACES is not in the same domain) but NOTEis not since it can produce TONE.Write a program that will read in the dictionary of a restricteddomain and determine the relative ananagrams. Note that single letterwords are, ipso facto, relative ananagrams since they cannot be``rearranged'' at all. The dictionary will contain no morethan 1000 words.

Input

Input will consist of a series of lines. No line will be more than 80characters long, but may contain any number of words. Words consist ofup to 20 upper and/or lower case letters, and will not be brokenacross lines. Spaces may appear freely around words, and at least onespace separates multiple words on the same line. Note that words thatcontain the same letters but of differing case are considered to beanagrams of each other, thus tIeD and EdiT are anagrams. The file willbe terminated by a line consisting of a single #.

Output

Output will consist of a series of lines. Each line will consist of asingle word that is a relative ananagram in the input dictionary.Words must be output in lexicographic (case-sensitive) order. Therewill always be at least one relative ananagram.

Sample Input

ladder came tape soon leader acme RIDE lone Dreis peat
 ScAlE orb  eye  Rides dealer  NotE derail LaCeS  drIed
noel dire Disk mace Rob dries
#

Sample Output

Disk
NotE
derail
drIed
eye
ladder
soon

分析：本题很适合用STL的map，接收所有的字符串存放在vector中，对每个字符串标准化（转小写排序）存放在map中，最后遍历vector，找到那些map中只有一个的string。 注意标准化是按题意来的，因为字符串中的每个字符可以任意顺序并且不考虑大小写，所以直接转话为小写并排序则得到的是同一个串。

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

using namespace std;

map<string,int> cnt;
vector<string> words;

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

int main()
{
	string s;
	while(cin >> s)
	{
		if(s[0]=='#')break;
		words.push_back(s);
		string ss = repr(s);
		if(!cnt.count(ss)) cnt[ss]=0;
		cnt[ss]++;
	}

	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;
}