Pagini recente » Borderou de evaluare (job #1973021) | Borderou de evaluare (job #2695610) | Cod sursa (job #412475) | Borderou de evaluare (job #2523163) | Cod sursa (job #2392080)
#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;
}