Cod sursa(job #2408383)
| Utilizator | Data | 17 aprilie 2019 21:36:03 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
#include <map>
#define MAXEL 2000000000
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int main(){
std::map<int,int> array_map;
int n,nr=0;
fin>>n;
for(int i=1;i<=n;i++){
int op,x;
fin>>op>>x;
if(op==1 and array_map.find(x)==array_map.end()) array_map[x]=++nr;
else if(op==2) array_map.erase(x);
else {
if(array_map.find(x)==array_map.end())
fout<<0;
else fout<<1;
fout<<'\n';
}
}
return 0;
}
