Pagini recente » Cod sursa (job #2390516) | Cod sursa (job #2813520) | Cod sursa (job #800909) | Cod sursa (job #418389) | Cod sursa (job #2378804)
#include <stdio.h>
#include <map>
#define MOD 666013
using namespace std;
int n, nr;
map <int, int> M;
int main()
{
int i, op, x;
freopen("hashuri.in", "r", stdin);
freopen("hashuri.out", "w", stdout);
scanf("%d ", &n);
for (i = 1; i <= n; i++){
scanf("%d%d ", &op, &x);
if (op == 1 && M.find(x)==M.end())
M[x] = ++nr;
if (op == 2)
M.erase(x);
if (op == 3){
if(M.find(x) != M.end()) printf("1\n");
else printf("0\n");
}
}
return 0;
}