Cod sursa(job #3129369)
Utilizator | Data | 14 mai 2023 04:00:16 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
#include <unordered_map>
#include <fstream>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int main()
{
int n;
int aux, aux2;
f >> n;
unordered_map<int, int> h;
while (f >> aux >> aux2) {
switch (aux) {
case 1:
if (!h.count(aux2)) {
h[aux2] = 1;
}
break;
case 2:
h.erase(aux2);
break;
case 3:
g << h.count(aux2) << endl;
break;
}
}
f.close();
g.close();
return 0;
}