UVa-156 Ananagrams(map映射)

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include<cstdlib>
#include<cstring>
#include <vector>
#include <queue>
#include <map>
#include <sstream>

using namespace std;
#define maxn 100100
map<string, int>ma;
std::vector<string> words;
string func(string str) {
    string ans = str;
    for (int i = 0; i < ans.length(); i++) {
        ans[i] = tolower(ans[i]);
    }

    sort(ans.begin(), ans.end());
    return ans;
}
int main() {
    std::ios::sync_with_stdio(false);
    string str;
    while (cin >> str) {
        if (str[0] == '#') {
            break;
        }
        words.push_back(str);
        string r = func(str);
        if (!ma.count(r)) {
            ma[r] = 0;
        }
        ma[r]++;
    }
    std::vector<string> ans;
    for (int i = 0; i < words.size(); i++) {
        if (ma[func(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;
}