Pagini recente » Cod sursa (job #2001616) | Cod sursa (job #2631430) | Cod sursa (job #1178150) | Cod sursa (job #181669) | Cod sursa (job #1999877)
#include <fstream>
using namespace std;
ifstream fin ("hashuri.in");
ofstream fout("hashuri.out");
int n, a, b, i, c[1000003], H[1000003], u, j;
int hashuire(int x){
return x%u;
}
int main()
{
fin>>n;
for(i=2;i<=n+10;i++){
if(c[i]==0){
for(j=i+i;j<=n+10;j+=i)
c[j]=1;
u=i;
}
}
for(i=1;i<=n;i++){
fin>>a>>b;
if(a==1){
H[hashuire(b)]=1;
}
else
if(a==2){
H[hashuire(b)]=0;
}
else
if(a==3){
fout<<H[hashuire(b)]<<'\n';
}
}
return 0;
}