Pagini recente » Cod sursa (job #2418954) | Cod sursa (job #630282) | Cod sursa (job #2543069) | Cod sursa (job #2965810) | Cod sursa (job #2741226)
#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;
}