Cod sursa(job #2212265)
| Utilizator | Data | 13 iunie 2018 18:04:22 | |
|---|---|---|---|
| Problema | Restante | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("restante.in");
ofstream out("restante.out");
const int NMAX = 36000;
string s[NMAX + 2];
int N;
int main()
{
in >> N;
for( int i = 0; i < N; ++i ) {
in >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s, s + N);
s[N] = "";
int cnt = 0;
if( s[0] != s[1] )
cnt = 1;
for( int i = 1; i < N; ++i )
if( s[i] != s[i - 1] && s[i] != s[i + 1] )
cnt++;
out << cnt << "\n";
return 0;
}
