Cod sursa(job #1574074)
| Utilizator | Data | 20 ianuarie 2016 09:31:45 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
#include <unordered_set>
using namespace std;
int main()
{
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
int n;
cin >> n;
unordered_set<int> H;
while (n--) {
int op, x;
cin >> op >> x;
switch (op) {
case 1:
H.insert(x);
break;
case 2:
H.erase(x);
break;
case 3:
cout << (H.find(x) != H.end()) << '\n';
break;
}
}
return 0;
}
