Pagini recente » Cod sursa (job #2004107) | Cod sursa (job #44829) | Cod sursa (job #2064780) | Cod sursa (job #1858101) | Cod sursa (job #1505602)
#include <bits/stdc++.h>
using namespace std;
map <int,int> m;
int nr;
int main()
{
freopen("hashuri.in", "r", stdin);
freopen("hashuri.out", "w", stdout);
int n, t, x, i;
scanf("%d", &n);
for(i=1; i<=n; i++)
{
scanf("%d %d", &t, &x);
if(t==1 && m.find(x)==m.end()) m[x]=++nr;
else if(t==2) m.erase(x);
else if(t==3)
{
if(m.find(x)!=m.end()) printf("1\n");
else printf("0\n");
}
}
return 0;
}