Pagini recente » Cod sursa (job #617960) | Cod sursa (job #883528) | Cod sursa (job #261143) | Cod sursa (job #2395232) | Cod sursa (job #1296356)
#include<stdio.h>
#include<iostream>
#include<map>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
int sol,p,n,i,m;
char s[100];
map<string,int> M;
int main()
{
freopen("restante.in","r",stdin);
freopen("restante.out","w",stdout);
scanf("%d ",&n);
for(i=1;i<=n;i++)
{
gets(s);
m=strlen(s);
sort(s,s+m);
M[(string)s]++;
p=M[s];
if(p==1)
sol++;
else if(p==2)
sol--;
}
printf("%d",sol);
return 0;
}