Cod sursa(job #2765194)
Utilizator | Data | 25 iulie 2021 18:28:54 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <unordered_set>
using namespace std;
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
unordered_set <int> s;
int x, op, n, i;
int main() {
cin >> n;
for(i = 0; i < n; i++) {
cin >> op >> x;
if(op == 1)
s.insert(x);
else if(op == 2)
s.erase(x);
else
cout << s.count(x) << '\n';
}
return 0;
}