uva 156 Ananagrams
Most crossword puzzle fans are used to anagrams--groups of words with the same letters in different orders--for example OPTS, SPOT, STOP, POTS and POST. Some words however do not have this attribute, no matter how you rearrange their letters, you cannot form another word. Such words are called ananagrams, an example is QUIZ.
Obviously such definitions depend on the domain within which we are working; you might think that ATHENE is an ananagram, whereas any chemist would quickly produce ETHANE. One possible domain would be the entire English language, but this could lead to some problems. One could restrict the domain to, say, Music, in which case SCALE becomes a relative ananagram (LACES is not in the same domain) but NOTE is not since it can produce TONE.
Write a program that will read in the dictionary of a restricted domain and determine the relative ananagrams. Note that single letter words are, ipso facto, relative ananagrams since they cannot be ``rearranged'' at all. The dictionary will contain no more than 1000 words.
Input
Input will consist of a series of lines. No line will be more than 80 characters long, but may contain any number of words. Words consist of up to 20 upper and/or lower case letters, and will not be broken across lines. Spaces may appear freely around words, and at least one space separates multiple words on the same line. Note that words that contain the same letters but of differing case are considered to be anagrams of each other, thus tIeD and EdiT are anagrams. The file will be terminated by a line consisting of a single #.
Output
Output will consist of a series of lines. Each line will consist of a single word that is a relative ananagram in the input dictionary. Words must be output in lexicographic (case-sensitive) order. There will 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的例题。
#include<iostream>
#include<string.h>
#include<cctype>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
string strlow(string &s) {
string temp = s;
for (int i = 0; i < temp.length(); i++) {
temp[i] = tolower(temp[i]);
}
sort(temp.begin(), temp.end());
return temp;
}
map<string,int> map1;
vector<string> words;
int main() {
string s;
while (cin >> s) {
if (s[0] == '#') break;
words.push_back(s);
string temp = strlow(s);
if (!map1.count(temp)) map1[temp] == 0;
map1[temp]++;
}
vector<string> fino;
for (int i = 0; i < words.size(); i++) {
if (map1[strlow(words[i])] == 1) {
fino.push_back(words[i]);
}
}
sort(fino.begin(), fino.end());
for (int i = 0; i < fino.size(); i++) {
cout << fino[i] << "\n";
}
return 0;
}