Pagini recente » Cod sursa (job #631053) | Cod sursa (job #1055327) | Cod sursa (job #1281030) | Cod sursa (job #104189) | Cod sursa (job #2450174)
#include <cstdio>
#include <set>
using namespace std;
const int MO=(1<<18);
set <int> g[MO];
int main()
{
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
int t,x;
scanf("%d%d",&t,&x);
int h=x%MO;
if(t==1) g[h].insert(x);
if(t==2) g[h].erase(x);
if(t==3) printf("%d\n",(g[h].find(x)!=g[h].end()));
}
return 0;
}