Pagini recente » Cod sursa (job #2546726) | Cod sursa (job #194653) | Cod sursa (job #1319031) | Cod sursa (job #238441) | Cod sursa (job #1953275)
#include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int N, answer;
string s, word[36002];
int main(){
freopen("restante.in", "r", stdin);
freopen("restante.out", "w", stdout);
scanf("%d", &N);
for(int i = 1; i <= N; i++){
cin >> s;
sort(s.begin(), s.end());
word[i] = s;
}sort(word + 1, word + N + 1);
word[0] = "1234567891011121314";
word[N+1] = "12345678910111213";
for(int i = 1; i <= N; i++){
if(word[i] != word[i-1] && word[i] != word[i+1]){
answer++;
}
}printf("%d", answer);
return 0;
}