Ananagrams

Ananagrams

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 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 <iostream>#include <string>#include <algorithm>using namespace std; string str, cstr[1005], s[1005];int num[1005];string low(string s){for (int i = 0; i < s.length(); i++){if (s[i] >= 'A' && s[i] <= 'Z')s[i] = s[i] + 32;}sort(s.begin(), s.end());return s;}void match(string &s, int n){for (int i = 0; i < n; i++)if (low(cstr[i]) == low(s)){num[i]++;return;}cstr[n] = s;num[n]++;}int main(){int n = 0;int m = 0;while (cin >> str && str != "#"){match(str, n);n++;}for (int i = 0, j = 0; i < n; i++){if (num[i] == 1) {s[j] = cstr[i];j++;m++;}}sort(s, s + m);for (int i = 0; i < m; i++)cout << s[i] << endl;return 0;}