Cod sursa(job #2313996)
Utilizator | Data | 7 ianuarie 2019 18:54:17 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int N,op,x;
set < int > myset;
int main()
{
f>>N;
for(int i=1;i<=N;i++)
{
f>>op>>x;
if(op==1) myset.insert(x);
else
if(op==2) myset.erase(x);
else
{
auto it=myset.find(x);
if(*it==x)
g<<1<<'\n';
else g<<0<<'\n';
}
}
return 0;
}