Cod sursa(job #569515)
Utilizator | Data | 1 aprilie 2011 17:07:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<cstdio>
#define FOR(i,x,z) for(i=2;i<=x;i++)
int main()
{
//freopen("ciur.in","r",stdin);
//freopen("ciur.out","w",stdout);
int i,j,prim[1000000],n,c=0;
scanf("%d",&n);
for(i=2;i<=n;i++)
prim[i]=1;
for(i=2;i<=n;i++)
if(prim[i])
{
c++;
for(j=2*i;j<=n;j+=i)
prim[j]=0;
}
printf("%d",c);
return 0;
}