Pagini recente » Cod sursa (job #2053766) | Cod sursa (job #1646331) | Cod sursa (job #943885) | Cod sursa (job #1332056) | Cod sursa (job #943887)
Cod sursa(job #943887)
#include <iostream>
#include <fstream>
#include <string>
#include <algorithm>
using namespace std;
ifstream in ("restante.in");
ofstream out ("restante.out");
string S[36010];
int main()
{
int N, i, j, Ans = 0, now = 1;
in >> N;
for (i = 1; i <= N; i ++){
in >> S[i];
sort (S[i].begin (), S[i].end ());
}
sort (S + 1, S + N + 1);
for (i = 1; i <= N; i ++){
if (S[i] == S[i + 1])
now ++;
else{
if (now == 1)
Ans ++;
now = 1;
}
}
out << Ans;
return 0;
}