Cod sursa(job #2601840)
Utilizator | Data | 15 aprilie 2020 12:12:35 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
map <int,int> harta;
int q,tip,nr,k;
int main () {
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d", &q);
for(int i=1;i<=q;++i){
scanf("%d%d", &tip, &nr);
if(tip==1 && harta.find(nr)==harta.end())
harta[nr]=1;
else if (tip==2)
harta.erase(nr);
else if(tip==3){
if(harta.find(nr)!=harta.end())
printf("1\n");
else
printf("0\n");
}
}
return 0;
}