Pagini recente » Cod sursa (job #2905757) | Cod sursa (job #2576348) | Cod sursa (job #1417105) | Cod sursa (job #2347345) | Cod sursa (job #1895669)
#include <fstream>
#include <algorithm>
#include <vector>
#include <cstring>
#include <map>
#include <set>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
set <int> m;
set <int> :: iterator it;
int main()
{
int n,i;
f>>n;
for(i=1;i<=n;i++)
{
int p,a;
f>>p;
if(p==1)
{
f>>a;
m.insert(a);
}
else
if(p==2)
{
f>>a;
it = m.find(a);
if(it != m.end())
m.erase(it);
}
else
{
f>>a;
if(m.find(a)==m.end())
g<<0<<'\n';else g<<1<<'\n';
}
}
return 0;
}