Description
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 laddersoon
题意:就是把每个单词重新排列,若只出现一次,则把原来的单词按字典序输出,使用multimap,将变换前后的单词关联起来,在判断是否符合输出条件
#include<bits/stdc++.h> using namespace std; int main() { int i; multimap<string,string>a; string ch; vector<string> ans; while(cin>>ch&&ch!="#") { string cb(ch); for(i=0;i<cb.size();i++) { cb[i]=tolower(cb[i]);//将字母都转换为小写字母 } sort(cb.begin(),cb.end());//重新排列得到的小写字母单词 a.insert(make_pair(cb,ch));//将两种单词联系存储 } for(multimap<string,string>::iterator j=a.begin();j!=a.end();j++) if(a.count(j->first)==1)//判断关键词出现的次数 ans.push_back(j->second); sort(ans.begin(),ans.end()); for(i=0;i<ans.size();i++) cout<<ans[i]<<endl; return 0; }
这里说说map与multimap区别,两者用法没什么区别,只是multimap能提供多对多,然而map只能一对一,有重复的自己就会去掉,并且是按KEY的从小到大排序的,所以multimap一个关键词能对应多个vaule