UVA 156 Ananagrams

把独一无二的字符串打印出来！

#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <vector>
#include <cctype>
#include <algorithm>
using namespace std;
map<string,int> m1;
vector<string> v1;
string trans(string str)
{
  int lenth=str.size();
  for(int i=0;i<lenth;++i)
  {
    str[i]=tolower(str[i]);
  }
  sort(str.begin(),str.end());
  return str;
}
int main()
{
  string tmp;
  while(cin >> tmp&&tmp != "#")
  {
    string tmp1;
    v1.push_back(tmp);
    tmp1=trans(tmp);
    m1[tmp1]++;
  }
  sort(v1.begin(),v1.end());
  for(vector<string>::iterator it=v1.begin();it!=v1.end();it++)
  {
    if(m1[trans(*it)]==1)
      cout<<*it<<endl;
  }
  return 0;
}