Cod sursa(job #1801654)
| Utilizator | Data | 9 noiembrie 2016 14:21:58 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <unordered_map>
#include <fstream>
#include <iostream>
using namespace std;
unordered_map<int,int>map1;
ifstream fin("hash.in");
ofstream fout("hash.out");
int main()
{
int n,c,a;
fin>>n;
for(int i=0;i<n;i++){
fin>>c;
if(c==1){
fin>>a;
map1[a]=1;
}
if(c==2){
fin>>a;
map1[a]=NULL;
}
if(c==3){
fin>>a;
if(map1[a]!=NULL)
fout<<1<<'\n';
else fout<<0<<'\n';
}
}
}
