Pagini recente » Cod sursa (job #2027109) | Cod sursa (job #67204) | Cod sursa (job #524709) | Cod sursa (job #1652626) | Cod sursa (job #1402769)
#include <cstdio>
#include <map>
using namespace std;
int N, op, x, cnt;
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] = ++cnt;
if (op == 2) M.erase(x);
if (op == 3) printf("%d\n", M.find(x) != M.end());
}
return 0;
}