Pagini recente » Cod sursa (job #2897169) | Cod sursa (job #2585174) | Cod sursa (job #2096581) | Cod sursa (job #3130170) | Cod sursa (job #2192801)
#include <cstdio>
#include <map>
using namespace std;
int n, NR;
map <int, int> m;
int main()
{
freopen("hashuri.in", "r", stdin);
freopen("hashuri.out", "w", stdout);
int x,t;
scanf("%d ", &n);
for (int i = 1; i <= n; i++)
{
scanf("%d %d ", &t, &x);
if (t == 1 && m.find(x)==m.end()) m[x] = ++NR;
if (t == 2) m.erase(x);
if (t == 3) printf("%d\n", m.find(x) != m.end());
}
return 0;
}