UVa 156 STL之map的运用

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

题目大意：给出多行字符串，将其中没有重复的单词按顺序输出。重复单词的定义是不考虑大小写，只要字母相同，字母顺序可以不同。顺序输出的顺序定义是按照字母ASCII码排序，并且考虑大小写问题。

解题思路：运用STL中的map的性质，没有重复的元素。并且可以通过键值直接查找。再结合vector储存原有的信息。最后比对，将满足要求的string储存在set中，自动排好序。输出。

#include <iostream>#include <algorithm>#include <string>#include <map>#include <set>#include <vector>#include <cstdio>using namespace std;map<string,int> ma;vector<string> ve;set<string> se;string fun( const string& s){    string ss=s;    for(int i=0 ; i<ss.length(); i++)    {        ss[i] = tolower(ss[i]);    }    sort(ss.begin(),ss.end());    return ss;}int main(){    //freopen("in.txt","r",stdin);    string s,res;    while(cin>>s)    {        if(s=="#")            break;        ve.push_back(s);        res=fun(s);        if( !ma.count(res) )            ma[res] = 0;        ma[res]++;    }    for(int i= 0 ;i<ve.size();i++)    {        if(ma[fun(ve[i])]==1)            se.insert(ve[i]);    }    for(set<string>::iterator i = se.begin();i!=se.end();i++)        cout<<*i<<endl;    return 0;}