Cod sursa(job #273728)

Utilizator petrecgClinciu Glisca Petre petrecg Data 8 martie 2009 22:31:34
Problema Ciurul lui Eratosthenes Scor 60
Compilator cpp Status done
Runda Arhiva educationala Marime 0.32 kb
Raporteaza aceasta sursa 
#include <stdio.h>
#include <math.h>
long i,j,k,n,prim[700000];
int main()
{freopen("ciur.in","r",stdin);freopen("ciur.out","w",stdout);
 scanf("%ld",&n);
 k=1;
 for(i=3;i<=n;i+=2)
  {if(!prim[i/2])
    {k++;for(j=i+i;j<=n;j+=i)if(j%2==1)prim[j/2]=1;}
  }
 printf("%ld",k);fclose(stdin);fclose(stdout);
 return 0;
}