Pagini recente » Istoria paginii runda/prega_casi_5.12.2018/clasament | Monitorul de evaluare | Cod sursa (job #1171243) | Cod sursa (job #1900585) | Cod sursa (job #1363564)
#include<stdio.h>
#include<unordered_set>
using namespace std;
unordered_set<int> x;
int main()
{
freopen("hashuri.in", "r", stdin);
freopen("hashuri.out", "w", stdout);
int n, m;
scanf("%d", &n);
for(int i = 0 ; i < n ; ++i) {
int op, val;
scanf("%d%d", &op, &val);
if(op == 1) x.insert(val);
if(op == 2) x.erase(val);
if(op == 3) if(x.find(val) != x.end()) printf("1\n");
else printf("0\n");
}
return 0;
}