Uva 156 - Ananagrams

 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 arelative 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  drIednoel dire Disk mace Rob dries#

Sample output

DiskNotEderaildrIedeyeladdersoon

题目大意：

把每个单词全部转化成小写字母，对每个单词，看它的字母重排后得到的单词在所有输入的单词中是否出现过，若没有出现，就输出原单词。

所有要输出的单词按字典序排列输出。

思路：

将所有输入单词存储并排序，将所有字母转化为小写另外存储，对另外存储的每个单词排序。

再对另外存储并排序的单词搜一遍，看每个单词是否只出现一次，出现一次，就将对应的原单词输出。

#include<stdio.h>#include<algorithm>#include<string.h>#include<string>#include<stdlib.h>#include<iostream>using namespace std;const int N = 5000;string str[N];struct In {string str1;string str2;bool flag;}in[N];bool com(In a,In b) {return a.str2<b.str2;}bool cmp(string str1,string str2) {string temp1 = str1;string temp2 = str2;sort(temp1.begin(),temp1.end());sort(temp2.begin(),temp2.end());return temp1 == temp2;}void change(string &str) {int len = str.size();for(int i=0;i<len;i++) {str[i] = tolower(str[i]);}}int main() {int count = 0;while(cin >> str[count]) {if(str[count][0] == '#') {sort(str,str+count);int num=0;for(int i=0;i<count;i++) {if(str[i] != str[i+1]) {in[num].str1 = str[i];in[num].str2 = str[i];num++;}}for(int i=0;i<num;i++) {change(in[i].str2);}//sort(in,in+num,com);for(int i=0;i<num;i++) {in[i].flag = true;}for(int i=0;i<num;i++) {for(int j=0;j<num;j++) {if( i != j) {if(cmp(in[i].str2,in[j].str2)) {in[i].flag = false;}}}}for(int i=0;i<num;i++) {if(in[i].flag == true) {cout << in[i].str1<<endl;}}}count++;}return 0;}