Pagini recente » Cod sursa (job #2869083) | Cod sursa (job #2855246) | Istoria paginii runda/ceva_ez | Istoria paginii runda/ana-are-mere/clasament | Cod sursa (job #1835404)
#include <iostream>
#include <map>
typedef long long ll;
using namespace std;
map<ll, bool> M;
int N;
int main(){
freopen("hashuri.in", "r", stdin);
freopen("hashuri.out", "w", stdout);
int op;
ll x;
cin >> N;
for(int i=0; i<N;i++){
cin >> op >> x;
if(op == 1)
M[x] = 1;
else
if(op == 2)
M[x] = 0;
else
cout << M[x] << "\n";
}
return 0;
}