Pagini recente » Cod sursa (job #47044) | Cod sursa (job #2243931) | Cod sursa (job #1994780) | Cod sursa (job #1554426) | Cod sursa (job #128871)
Cod sursa(job #128871)
#include <stdio.h>
#include <algorithm>
#include <string>
using namespace std;
#define nmax 36111
#define FOR(i,s,d) for(i=(s);i<(d);++i)
string v[nmax];
char s[32];
int n,sol;
int main()
{
int i;
freopen("restante.in","r",stdin);
freopen("restante.out","w",stdout);
scanf("%d",&n);
FOR(i,0,n)
{
scanf("%s",s);
v[i]=s;
sort(v[i].begin(),v[i].end());
}
sort(v,v+n);
FOR(i,0,n)
if((i==0 || v[i]!=v[i-1]) && (i==n-1 || v[i]!=v[i+1]))
sol++;
printf("%d\n",sol);
return 0;
}