Pagini recente » Cod sursa (job #809750) | Cod sursa (job #1704025) | Cod sursa (job #2216095) | Cod sursa (job #3217064) | Cod sursa (job #2014096)
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
const int MAXN = 3e4 + 6e3;
char c[16];
std::string s[MAXN + 1];
int main() {
int n, ans;
freopen("restante.in", "r", stdin);
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
gets(c);
std::sort(c, c + strlen(c));
s[i] = c;
}
std::sort(s + 1, s + 1 + n);
ans = 0;
if (s[1] != s[2]) ++ans;
for (int i = 1; i <= n; ++i) {
if (s[i - 1] != s[i] && s[i] != s[i + 1]) {
++ans;
}
}
FILE *fout = fopen("restante.out", "w");
fprintf(fout, "%d\n", ans);
fclose(fout);
return 0;
}