标签:har nbsp 接下来 des input mil problem log otto
1
/*
* Author: Lslsa
* Created Time: 2017/10/7 8:21:36
* File Name: 20171004_D.cpp
*/
#include<cstdio>
#include<string>
#include<map>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 1e5+5;
char a[maxn];
map<string, int> mp;
int main() {
int N;
while(scanf("%d",&N)==1){
mp.clear();
for(int i=0;i<N;i++){
int sum = 0;
scanf("%s",a);
sort(a,a+strlen(a));
printf("%d\n",mp[a]++);
}
}
return 0;
}
标签:har nbsp 接下来 des input mil problem log otto
原文地址:http://www.cnblogs.com/gjy963478650/p/7634138.html