Cod sursa(job #2869808)
Utilizator | Data | 11 martie 2022 20:44:21 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
map<int,bool>h;
int main()
{
int n; in>>n;
for(int i=1;i<=n;i++)
{
int op,x; in>>op>>x;
if(op == 1 && h.find(x) == h.end()) h[x]=1;
if(op == 2 && h.find(x) != h.end()) h.erase(x);
if(op == 3 ) out<<bool(h.find(x) != h.end())<<'\n';
}
return 0;
}