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