Cod sursa(job #2741226)
Utilizator | Data | 15 aprilie 2021 18:46:56 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream F ("hashuri.in");
ofstream G ("hashuri.out");
set <int> heap;
int main()
{
int n, op, x;
F>>n;
for(int i = 0; i < n; i++)
{
F>>op>>x;
if(op == 1)
{
heap.insert(x);
}
else if(op == 2)
{
if(heap.count(x))
heap.erase(x);
}
else if (op == 3)
if(heap.count(x))
G<<1<<'\n';
else G<<0<<'\n';
}
return 0;
}