Cod sursa(job #2741048)
Utilizator | Data | 15 aprilie 2021 13:30:10 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int n;
unordered_map<int, bool> m;
int main()
{
int i, x, op;
fin >> n;
for(i=1; i<=n; i++)
{
fin >> op >> x;
if(op==1)
m[x]=1;
else if(op==2)
m.erase(x);
else
fout << m.count(x) << '\n';
}
return 0;
}