Cod sursa(job #2496681)
| Utilizator | Data | 21 noiembrie 2019 14:37:48 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include <bits/stdc++.h>
using namespace std;
unordered_map <int,bool> a;
int main()
{
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
int n,x,q;cin>>n;
for(int i=1;i<=n;++i){
cin>>q>>x;
if(q==1)a[x]=1;
if(q==2)a[x]=0;
if(q==3) cout<<a[x]<<'\n';
}
}
