Cod sursa(job #2392080)
Utilizator | Data | 29 martie 2019 17:25:27 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
set<int>v;
int n, p, x, nr, minim, k;
int main()
{
f>>n;
for(int i=1; i<=n; i++)
{
f>>p;
if(p==1)
{
f>>x;
v.insert(x);
}
else if(p==2)
{
f>>x;
if(v.count(x)) v.erase(x);
}
else
{
f>>x;
g<<(v.count(x))<<'\n';
}
}
return 0;
}