Pagini recente » Cod sursa (job #1977166) | Cod sursa (job #803098) | Cod sursa (job #1558639) | Cod sursa (job #1714073) | Cod sursa (job #2780520)
#include<cstdio>
#include<queue>
#include<map>
#include<unordered_map>
using namespace std;
FILE*in=fopen("hashuri.in","r");
FILE*out=fopen("hashuri.out","w");
const int mod1=100003,mod2=100153;
int m1[mod1],m2[mod2];
int n,i,op,a;
int main()
{
fscanf(in,"%d",&n);
for(i=1;i<=n;i++)
{
fscanf(in,"%d%d",&op,&a);
if(op==1)
{
m1[a%mod1]=1;
m2[a%mod2]=1;
}
else if(op==2)
{
if(m1[a%mod1]==1&&m2[a%mod2]==1)
{
m1[a%mod1]=0;
m2[a%mod2]=0;
}
}
else
{
if(m1[a%mod1]==1&&m2[a%mod2]==1)
{
fprintf(out,"1\n");
}
else
{
fprintf(out,"0\n");
}
}
}
}