Pagini recente » Borderou de evaluare (job #2056561) | Cod sursa (job #3174901) | Cod sursa (job #25022) | Cod sursa (job #3205452) | Cod sursa (job #2345291)
#include <cstdio>
#include <string>
#include <algorithm>
#include <unordered_map>
#define NMAX 36005
using namespace std;
unordered_map <string,int> v;
string s;
int main() {
freopen("restante.in","r",stdin);
freopen("restante.out","w",stdout);
int n,i,j;
scanf("%d",&n);
for( i = 1; i <= n; i ++ ) {
scanf("%s",s);
sort(s.begin(),s.end());
v[s] ++;
}
j = 0;
for( const auto &m : v )
if( m.second == 1 )
j ++;
printf("%d",j);
return 0;
}