UVA156 反片语 Ananagrams

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
#

#include<iostream>
#include<vector>
#include<map>
#include<string>
#include<algorithm>
using namespace std;
/*
题目思路
1.使用vector v1存储单词,以便后期使用
2.写一个函数:可以将单词变成小写,有序
3.使用map集合统计每个单词(函数处理后)的个数.
4.遍历vector v1如果  在map中出现的次数为1那么就找到啦满足题意的单词,再加到新的vector  v2中;
5.对v2进行排序,然后输出即可.
*/
string s;
vector<string> v1, v2;
map<string, int> m;
string low_sort(string s1) {
  for (int i = 0; i < s1.size(); i++) {
    s1[i] = tolower(s1[i]);
  }
  sort(s1.begin(), s1.end());
  return s1;
}
int main() {
  while (cin >> s && s[0] != '#') {
    v1.push_back(s);
    if (!m.count(low_sort(s))) {
      m[low_sort(s)] = 1;
    }
    else {
      m[low_sort(s)]++;
    }
  }
  for (int i = 0; i < v1.size(); i++) {
    if (m[low_sort(v1[i])] == 1) {
      v2.push_back(v1[i]);
    }
  }
  sort(v2.begin(), v2.end());
  for (int i = 0; i < v2.size(); i++) {
    cout << v2[i] << endl;
  }
  return 0;
}