Pagini recente » Cod sursa (job #1172085) | Cod sursa (job #361452) | Cod sursa (job #1702196) | Cod sursa (job #2913344) | Cod sursa (job #2119749)
#include <bits/stdc++.h>
#define in "hashuri.in"
#define out "hashuri.out"
using namespace std;
int N, NR;
map <int, int> M;
int main()
{
freopen(in, "r", stdin);
freopen(out, "w", stdout);
int i, tip, x;
scanf("%d ", &N);
for (i = 1; i <= N; i++)
{
scanf("%d %d ", &tip, &x);
if (tip == 1 && M.find(x)==M.end()) M[x] = ++NR;
if (tip == 2) M.erase(x);
if (tip == 3) printf("%d\n", M.find(x) != M.end());
}
return 0;
}