Cod sursa(job #1535546)
Utilizator | Data | 24 noiembrie 2015 21:48:22 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
#include <unordered_set>
using namespace std;
ifstream f("hashuri.in");
ofstream of("hashuri.out");
int main(){
unordered_set<int> H;
int N, x, op;
f >> N;
for (int i = 1; i <= N; ++i){
f >> op >> x;
if (op == 1)H.insert(x);
else if (op == 2)H.erase(x);
else if (op == 3)of << (H.count(x) > 0) << "\n";
}
}