Pagini recente » Cod sursa (job #1602489) | Cod sursa (job #2078344) | Monitorul de evaluare | Cod sursa (job #2236802) | Cod sursa (job #1728445)
#include <fstream>
#include <cstdio>
#include <unordered_map>
using namespace std;
int N, i, op, x;
unordered_map<int, int> dp;
int main()
{
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)
dp[x]=1;
if (op==2)
dp[x]=0;
if (op==3)
printf("%d\n", dp[x]);
}
return 0;
}