Cod sursa(job #3130149)
Utilizator | Data | 16 mai 2023 22:39:53 | |
---|---|---|---|
Problema | Hashuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream f("hasuri.in");
ofstream g("hasuri.out");
int main() {
int n,op,x,i;
f>>n;
set<int> v;
for(i=1;i<=n;i++)
{
f>>op>>x;
if(op==1)
{
if (v.count(x)==0)
{
v.insert(x);
}
}
if(op==2)
{
if (v.count(x)>0)
v.erase(x);
}
if(op==3)
{
if (v.count(x)>0)
g<<1<<endl;
else g<<0<<endl;
}
}
return 0;
}