Pagini recente » Cod sursa (job #252837) | Cod sursa (job #1140397) | Cod sursa (job #2751348) | Cod sursa (job #2487897) | Cod sursa (job #2088375)
#include <fstream>
#include <set>
using namespace std;
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
const int val=10000;
const int nmax=2000000000;
struct fint
{
set<int>s;
};
fint v[nmax/val];
int f(int x)
{
return x/val;
}
int n;
int t,x,y;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>t>>x;
y=f(x);
if(t==1)
v[y].s.insert(x);
if(t==2)
v[y].s.erase(x);
if(t==3)
{
set<int>::iterator it;
it=v[y].s.find(x);
if(it==v[y].s.end())
cout<<"0\n";
else
cout<<"1\n";
}
}
return 0;
}
/**
**/