Pagini recente » Cod sursa (job #890648) | Borderou de evaluare (job #2235225) | Borderou de evaluare (job #241479) | Cod sursa (job #425033)
Cod sursa(job #425033)
//#include "stdafx.h"
#include<stdio.h>
#include<map>
using namespace std;
map <int , int> x;
int i,n,k,p,m;
int main()
{
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%d%d",&k,&p);
if (k==1)
if (x.find(p)==x.end())
x[p]=++m;
if (k==2) x.erase(p);
if (k==3)
if (x.find(p)!=x.end())
printf("1\n");
else
printf("0\n");
}
return 0;
}