Cod sursa(job #3130764)
| Utilizator | Data | 18 mai 2023 15:40:05 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
int main() {
ifstream in("hashuri.in");
ofstream out("hashuri.out");
int N;
in >> N;
unordered_map<int, bool> multime;
for (int i = 0; i < N; i++) {
int op, x;
in >> op >> x;
if (op == 1) {
multime[x] = true;
} else if (op == 2) {
multime.erase(x);
} else if (op == 3) {
int rezultat = (multime.count(x) > 0) ? 1 : 0;
out << rezultat << "\n";
}
}
in.close();
out.close();
return 0;
}
