Cod sursa(job #2601831)
| Utilizator | Data | 15 aprilie 2020 12:03:03 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 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);++q;
while(--q) {
scanf("%d%d", &tip, &nr);
if(tip==1 && harta.find(nr)==harta.end())
harta[nr]=++k;
else if (tip==2)
harta.erase(nr);
else {
if(harta.find(nr)!=harta.end())
printf("1\n");
else
printf("0\n");
}
}
return 0;
}
