Pagini recente » Cod sursa (job #2382432) | Cod sursa (job #2164910) | Cod sursa (job #2030000) | Cod sursa (job #268877) | Cod sursa (job #2909902)
#include <fstream>
#include <set>
#include <cmath>
using namespace std;
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
set <int> S[1005];
int main()
{
int n,a,b;
cin>>n;
int rad=sqrt(n);
for(int i=1; i<=n; i++)
{
cin>>a>>b;
if(a==1)
{
S[b%rad].insert(b);
}
else if(a==2)
{
S[b%rad].erase(b);
}
else
{
if(S[b%rad].find(b)!=S[b%rad].end())
cout<<1;
else
cout<<0;
cout<<'\n';
}
}
return 0;
}