Cod sursa(job #1296356)
Utilizator | Data | 21 decembrie 2014 01:03:16 | |
---|---|---|---|
Problema | Restante | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#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;
}