Pagini recente » Cod sursa (job #2603551) | Cod sursa (job #653010) | Cod sursa (job #468143) | Cod sursa (job #3187178) | Cod sursa (job #1195913)
#include <iostream>
#include <fstream>
#include <map>
#include <stdio.h>
using namespace std;
int N,op,x;
map <int,int> M;
int main()
{
freopen("hashuri.in", "r",stdin);
freopen("hashuri.out", "w" , stdout);
scanf("%d ",&N);
for (int i=1; i<=N ; i++)
{
scanf("%d %d",&op,&x);
if (op == 1 && M.find(x) == M.end()) M[x] = 1;
if (op == 2 ) M.erase(x);
if (op == 3 ) printf("%d\n",M.find(x) != M.end());
}
return 0;
}