Pagini recente » Cod sursa (job #2730656) | Cod sursa (job #3213203) | Cod sursa (job #1280108) | Cod sursa (job #3170517) | Cod sursa (job #2372199)
#include <iostream>
#include <cstdio>
#include <map>
using namespace std;
int n, op, nr, poz;
map <int, int> m;
int main()
{
freopen("hashuri.in", "r", stdin);
freopen("hashuri.out", "w", stdout);
scanf("%d\n", &n);
for(int i=0;i<n;i++)
{
scanf("%d %d\n", &op, &nr);
if(op==1)
{
if(m.find(nr)==m.end())
m[nr]=poz++;
}
else
if(op==2)
{
if(m.find(nr)!=m.end())
m.erase(nr);
}
else
{
if(m.find(nr)!=m.end())
printf("1\n");
else
printf("0\n");
}
}
return 0;
}