UVa156 map

#include<iostream>#include<map>#include<string>#include<vector>#include<algorithm>#include<cctype>using namespace std;map<string,int> cnt;vector<string> words;string sortr(string &s){    //一个单词的每个字母换成小写，排序    string ss=s;    for(int i=0;i<ss.length();i++)        ss[i]=tolower(ss[i]);    sort(ss.begin(),ss.end());    return ss;}int main(){    int n=0;    string s;    while(cin>>s){        if(s=="#") break;        words.push_back(s);        string r=sortr(s);        if(!cnt.count(r)) cnt[r]=0;   //别忘了初始化,()是调用函数的参数，[]是放下标。        cnt[r]++;    }    vector<string> ans;    for(int i=0;i<words.size();i++){        if(cnt[sortr(words[i])]==1) ans.push_back(words[i]);    }    sort(ans.begin(),ans.end());    for(vector<string>::iterator it=ans.begin();it!=ans.end();it++)        cout<<*it<<endl;}