Pagini recente » Rezultatele filtrării | Cod sursa (job #1584327) | Cod sursa (job #2623056) | Cod sursa (job #3187940) | Cod sursa (job #424990)
Cod sursa(job #424990)
//#include "stdafx.h"
#include<stdio.h>
#include<set>
using namespace std;
set <int> x;
int i,n,k,p;
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) x.insert(p);
if (k==2) if (x.find(p)!=x.end()) x.erase(x.find(p));
if (k==3)
if (x.find(p)!=x.end())
printf("1\n");
else
printf("0\n");
}
return 0;
}