Cod sursa(job #2190137)
Utilizator | Data | 29 martie 2018 20:56:09 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
int n, nr, op, x;
unordered_map<int,int>M;
int main()
{
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
fin>>n;
while(n--)
{
fin>>op>>x;
if(op==1 && M.find(x)==M.end())
M[x]=++nr;
if(op==2)
M.erase(x);
if(op==3)
fout<<(M.find(x)!=M.end())<<'\n';
}
return 0;
}