Pagini recente » Cod sursa (job #2113325) | Cod sursa (job #773528) | Cod sursa (job #636546) | Cod sursa (job #1819934) | Cod sursa (job #421935)
Cod sursa(job #421935)
#include <cstdio>
#define NMAX 1000010
#define MOD1 543997
#define MOD2 544001
int N;
bool a[MOD1];
bool b[MOD2];
/*bool e[NMAX];
void ciur()
{
for(int i = 2 ; i * i < NMAX ; i++)
if(!e[i])
for(int j = i * i ; j < NMAX ; j += i)
e[j] = 1;
int nr = 0;
for(int i = 543987 ; nr < 2 && i < NMAX; i++)
if(!e[i])
{
printf("%d\n",i);
nr++;
}
}*/
void citeste()
{
int id , x;
scanf("%d",&N);
for(int i = 1 ; i <= N ; i++)
{
scanf("%d%d",&id,&x);
if(id == 1)
{
a[x % MOD1] = 1;
b[x % MOD2] = 1;
}
if(id == 2)
{
a[x % MOD1] = 0;
b[x % MOD2] = 0;
}
if(id == 3)
if(a[x % MOD1] && b[x % MOD2])
printf("%d\n",1);
else
printf("%d\n",0);
}
}
int main()
{
freopen("hash.in","r",stdin);
freopen("hash.out","w",stdout);
//ciur();
citeste();
return 0;
}