Cod sursa(job #3166247)
Utilizator | Petra Hedesiu Petra | Data | 7 noiembrie 2023 23:40:15 |
---|---|---|---|
Problema | Restante | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
#include <map>
#include <string>
#include <algorithm>
using namespace std;
ifstream fin ("restante.in");
ofstream fout ("restante.out");
int n, k;
string a;
map<string, int> fr;
int main()
{
fin >> n;
for (int i = 1; i <= n; i++)
{
fin >> a;
sort(a.begin(), a.end());
fr[a]++;
if (fr[a]==1) k++;
if (fr[a]==2) k--;
}
fout << k;
return 0;
}