Cod sursa(job #1811374)
| Utilizator | Data | 21 noiembrie 2016 10:19:55 | |
|---|---|---|---|
| Problema | Restante | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("restante.in");
ofstream g("restante.out");
const int nMax = 36003;
string cuv[nMax];
map <string, int> Mp;
int main()
{
int n;
f >> n;
for(int i = 1; i <= n; i++) {
f>> cuv[i];
}
for(int i = 1; i <= n; i++) {
sort(cuv[i].begin(),cuv[i].end());
}
for(int i = 1; i <= n; i++) {
Mp[cuv[i]]++;
}
int ans = 0;
for(int i = 1; i <= n; i++) {
if(Mp[cuv[i]] == 1) {
ans++;
}
}
g << ans;
return 0;
}
