Cod sursa(job #2622837)
| Utilizator | Data | 1 iunie 2020 22:20:06 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream in ("hashuri.in");
ofstream out ("hashuri.out");
unordered_map <int, int> a;
unordered_map <int, int>::iterator b;
int n,op,nr;
int main()
{
int n;
in>>n;
for (int i=1;i<=n;++i)
{
in>>op>>nr;
if (op==1)
a.insert(make_pair(nr,1));
if (op==2)
{
b=a.find(nr);
if (b!=a.end());
a.erase(nr);
}
if (op==3)
{
b=a.find(nr);
if (b!=a.end())
out<<1<<'\n';
else
out<<0<<'\n';
}
}
return 0;
}
