Ananagrams UVA - 156

题目链接：Ananagrams UVA - 156

题目：输入一些单词，找出所有满足如下条件的单词：该单词不能通过字母重排，得到输入的单词。

分析：将所有单词标准化。。。。

代码：

#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#include<iomanip>
#include<set>
#include<sstream>
#define ll long long

using namespace std;

map<string, int> cnt;
vector<string> words;


string repr(const string &s) {
    string ans = s;
    for(int i = 0; i < s.length(); i++)
        ans[i] = tolower(ans[i]);
    sort(ans.begin(), ans.end());
    return ans;
}

int main()
{
    int n = 0;
    string s;
    while(cin >> s) {
     if(s[0] == '#') break;
     words.push_back(s);
     string r = repr(s);
     if(!cnt.count(r)) cnt[r] = 0;
     cnt[r] ++;
    }
    vector<string> ans;
    for(int i = 0; i < words.size(); i++)
        if(cnt[repr(words[i])] == 1) ans.push_back(words[i]);
    sort(ans.begin(), ans.end());
    for(int i = 0; i < ans.size(); i++)
        cout << ans[i] << endl;
    return 0;
}