Cod sursa(job #2698974)
Utilizator | Data | 23 ianuarie 2021 12:55:11 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <unordered_set>
using namespace std;
unordered_set<int> s;
int main()
{
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
int n,a,b;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a>>b;
if(a==1)
{
s.insert(b);
}
if(a==2)
{
s.erase(b);
}
if(a==3)
{
if(s.find(b)==s.end()) cout<<0<<'\n';
else cout<<1<<'\n';
}
}
return 0;
}