Cod sursa(job #2469343)
| Utilizator | Data | 6 octombrie 2019 19:54:44 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
#include <iostream>
#include <stdio.h>
#include <unordered_map>
using namespace std;
unordered_map <int, int> mMap;
int queries;
int main()
{
freopen("hashuri.in", "r", stdin);
freopen("hashuri.out", "w", stdout);
int type, param;
scanf("%d",&queries);
for(int i = 0 ; i < queries; i++)
{
scanf("%d%d",&type,¶m);
if(type == 1)
mMap[param] = 1;
if(type == 2)
mMap.erase(param);
if(type == 3)
{
printf("%d\n",mMap.find(param) != mMap.end());
}
}
return 0;
}