patembe dot com

Sorry, this entry is only available in Bahasa Indonesia version.

class SieveOfAtkins {
public static void main (String args[]){
int max=1000000;
boolean prima[] = new boolean [max+1];
prima[0]=prima[1]=prima[4]=false;
prima[2]=prima[3]=true;
for(int i=5;i<=max;i++)
{
prima[i]=false;
}
double akarN=Math.sqrt(max);
int n;
for (int i=1;i<=akarN;i++)
{
for(int j=1;j<=akarN;j++)
{
n=(4*(i*i))+(j*j);
if((n<=max)&&(((n % 12)==1) || ((n % 12)==5))) {
prima[n]=!prima[n];
}
n=(3*(i*i))+(j*j);
if((n<=max)&&((n % 12)==7)){
prima[n]=!prima[n];
}