UVA 156 （map+vector）字典匹配

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

using namespace std;

typedef long long LL;

map<string,int> dics;
vector<string> words;
vector<string> ans;

string fun(const string& s)
{
    string t=s;
    int len=t.size();
    for(int i=0;i<len;i++)
        t[i]=tolower(t[i]);
    sort(t.begin(),t.end());
    return t;
}

int main()
{
    string s;
    while(cin>>s&&s[0]!='#')
    {
        dics[fun(s)]++;
        words.push_back(s);
    }
    int len=words.size();
    for(int i=0;i<len;i++)
        if(dics[fun(words[i])]==1)
           ans.push_back(words[i]);
    sort(ans.begin(),ans.end());
    len=ans.size();
    for(int i=0;i<len;i++)
        cout<<ans[i]<<endl;
    return 0;
}