Cod sursa(job #3215658)
Utilizator | Marinescu Eugenio eugenio | Data | 15 martie 2024 11:22:29 |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
unordered_map<int,bool> mp;
int q, op, x;
int main()
{
cin>>q;
while(q--)
{
cin>>op>>x;
if(op==1){
mp[x]=1;
}
if(op==2){
if(mp.find(x)!=mp.end()){
mp.erase(mp.find(x));
}
}
if(op==3){
if(mp.find(x)!=mp.end()){
cout<<1<<'\n';
}
else cout<<0<<'\n';
}
}
}