Pagini recente » Cod sursa (job #966272) | Clasament onis-2014-runda-1 | Cod sursa (job #84665) | Cod sursa (job #666442) | Cod sursa (job #1309255)
#include <cstdio>
#include <map>
using namespace std;
int n, type, i, x, qq;
map<int, int> kush;
int main ()
{
freopen("hashuri.in", "rt", stdin);
freopen("hashuri.out", "wt", stdout);
scanf("%d", &n);
for(i=1; i<=n; ++i)
{
scanf("%d%d", &type, &x);
if(type==1 && kush.find(x)==kush.end()) kush[x]=++qq;
if(type==2) kush.erase(x);
if(type==3) printf("%d\n", kush.find(x)!=kush.end());
}
return 0;
}