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

输入一些单词，找出所有满足如下条件的单词：该单词不能通过字母重排，得到输入文本中的另外一个单词。在判断是否满足条件时，字母不分大小写，但在输出时应保留输入中的大小写，按字典序进行排列（所有大写字母在所有小写字母的前面）。

#include <iostream>
#include <string>
#include <map>
#include <algorithm>
#include <vector>

using namespace std;
// 单词映射<单词,出现次数>
map<string, int> content;
// 单词容器
vector<string> words;

// 将单词s进行标准化
string repr(const string s) {
    string ans = s;
    // 小写
    for(int i = 0; i < ans.length(); i++) {
        ans[i] = tolower(ans[i]);
    }
    // 重排
    sort(ans.begin(), ans.end());
    return ans;
}

int main() {
    string s;
    while(cin >> s) {
        if(s[0] == ‘#‘) {
            break;
        }
        words.push_back(s);
        string r = repr(s);
        // 该单词不存在
        if(!content.count(r)) {
            content[r] = 0;
        }
        content[r]++;
    }
    // 答案
    vector<string> ans;
    for(int i = 0; i < words.size(); i++) {
        // 只出现一次
        if(content[repr(words[i])] == 1) {
            ans.push_back(words[i]);
        }
    }
    // 字典排序
    sort(ans.begin(), ans.end());
    vector<string>::iterator it;
    for(it = ans.begin(); it != ans.end(); it++) {
        cout << *it << endl;
    }
    return 0;
}