Pagini recente » Cod sursa (job #920703) | Cod sursa (job #851578) | Borderou de evaluare (job #629837) | Borderou de evaluare (job #37551) | Cod sursa (job #1771710)
#include <cstdio>
#include <map>
using namespace std;
int main()
{
freopen("hashuri.in", "r", stdin);
freopen("hashuri.out", "w", stdout);
map <int, int> m;
int n, tip, x, no=0;
scanf("%d", &n);
for(int i=1; i<=n; i++)
{
scanf("%d %d", &tip, &x);
if(tip==1 && m.find(x)==m.end()) m[x]=++no;
if(tip==2) m.erase(x);
if(tip==3)
{
int ok;
if(m.find(x) != m.end()) ok=1;
else ok=0;
printf("%d\n",ok);
}
}
}