Pagini recente » Cod sursa (job #2209195) | Cod sursa (job #2669701) | Cod sursa (job #1306716) | Cod sursa (job #2089088) | Cod sursa (job #2417574)
#include <bits/stdc++.h>
using namespace std;
int n, t, x;
unordered_set<int>st;
int main()
{
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d",&n);
for (int i=1;i<=n;++i)
{
scanf("%d %d",&t,&x);
if (t == 1)
st.insert(x);
else
if (t == 2)
st.erase(x);
else
{
if (st.count(x))
printf("1\n");
else
printf("0\n");
}
}
fclose(stdin);
fclose(stdout);
return 0;
}