Cod sursa(job #2552331)
Utilizator | Data | 20 februarie 2020 19:24:40 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <bits/stdc++.h>
using namespace std;
int N,x,t;
unordered_map<int,bool> um;
int main(){
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> N;
while(N--){
cin >> t >> x;
if(t == 1)
um[x] = 1;
else if(t == 2)
um[x] = 0;
else
cout << um[x] << '\n';
}
}