Cod sursa(job #2588565)
| Utilizator | Data | 24 martie 2020 22:40:48 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
set <int> G;
int main () {
ifstream fin ("hashuri.in");
ofstream fout ("hashuri.out");
ios::sync_with_stdio(false);
int n, key, x;
fin >> n;
for (; n; n--) {
fin >> key >> x;
switch (key) {
case 1:
G.insert(x);
break;
case 2:
G.erase(x);
break;
case 3:
fout << (G.find(x) != G.end()) << '\n';
break;
}
}
return 0;
}
