Cod sursa(job #926318)
Utilizator | Apopeid Alejandro apopeid13 | Data | 25 martie 2013 09:40:41 |
---|---|---|---|
Problema | Restante | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.55 kb |
#include<fstream>
#include<cstring>
#include<algorithm>
using namespace std;
int i,n,sol;
char v[20];
string a[36001];
int main()
{
freopen("restante.in","r",stdin);
freopen("restante.out","w",stdout);
scanf("%d\n",&n);
for(i=1;i<=n;++i)
{
gets(v);
sort(v,v+strlen(v));
a[i]=v;
}
sort(a+1,a+n+1);
if(a[1]!=a[2])
sol++;
for(i=2;i<n;++i)
if(a[i]!=a[i+1]&&a[i]!=a[i-1])
++sol;
if(a[n]!=a[n-1])
++sol;
printf("%d",sol);
return 0;
}