Cod sursa(job #2624959)
| Utilizator | Data | 5 iunie 2020 17:05:00 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.72 kb |
#include <fstream>
#<include <unordered_map>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
unordered_map <int, int> map1;
unordered_map <int, int>::iterator map2;
int n,op,nr;
int main()
{
int n;
f>>n;
for(int i=0;i<n;i++)
{
fin>>op>>nr;
if(op==1)
map1.insert(make_pair(nr,1))
if(op==2)
{
map2=map1.find(nr);
if(map2!=map1.end());
map1.erase(nr);
}
if(op==3)
{
map2=map1.find(nr);
if(map2!=map1.end())
fout<<1<<"\n";
else
fout<<0<<"\n"
}
}
return 0;
}
