51nod 1095 Anigram单词 【map的使用】

#include<iostream>#include<map>#include<algorithm>#include<vector>using namespace std;map<string,int> ans;  //该字符是否存在map<string,int> a; //该字符排好序的有几个int n,m;string judge(string a){    string e=a;    sort(e.begin(),e.end());    return e;}int main(){    string z[10000];    string y;    cin>>n;    for(int i=0;i<n;i++){   cin>>z[i];a[judge(z[i])]++;ans[z[i]]=1;}    cin>>m;    for(int i=0;i<m;i++)  {// 10000        cin>>y;        if(ans[y]==1)   cout<<a[judge(y)]-1<<endl;        else cout<<a[judge(y)]<<endl;    }    return 0;}