Cod sursa(job #2910630)
| Utilizator | Data | 23 iunie 2022 01:38:18 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
map<int,int> m;
int main() {
int n; fin >> n;
for(int i = 1; i <= n; i++) {
int op, x; fin >> op >> x;
if(op == 1) {
m[x]++;
}
if(op == 2) {
m.erase(x);
}
if(op == 3) {
if(m[x] != 0) {
fout << 1 << "\n";
} else {
fout << 0 << "\n";
}
}
}
return 0;
}