Cod sursa(job #2182677)
Utilizator | Data | 22 martie 2018 16:15:36 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
map<int, int>H;
int n, nr, x, op;
int main()
{
fin>>n;
for(int i=1; i<=n; ++i)
{
fin>>op>>x;
if(op==1)
{
if(H.find(x)==H.end()) H[x]=++nr;
}
if(op==2) H.erase(x);
if(op==3) fout<<(H.find(x)!=H.end())<<"\n";
}
return 0;
}