Cod sursa(job #163995)
Utilizator | Data | 23 martie 2008 13:27:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <stdio.h>
char ciur[2000002];
int main ()
{freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
long n,i,j,vf=1;
scanf("%ld",&n);
ciur[1]=1;
for (i=3;i*i<=n;i+=2)
{if(ciur[i]==0)
{
for (j=i*i;j<=n;j+=2*i)
ciur[j]=1;
}
}
for (j=0,i=3;i<=n;i+=2)
{if(ciur[i]==0)
j++;
}
printf("%ld",j+1);
return 0;
}