Cod sursa(job #1207034)
| Utilizator | Data | 11 iulie 2014 21:33:10 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <map>
using namespace std;
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
map <int,int> Hash;
int n,nr, i, tip, x,aux;
int main()
{
cin>>n;
while(n--){
cin>>aux>>x;
if (aux==1 && Hash.find(x)==Hash.end()) Hash[x]=++nr;
if (aux==2) Hash.erase(x);
if (aux==3) if (Hash.find(x)!=Hash.end()) cout<<"1 \n";
else cout<<"0 \n";
}
return 0;
}
