Cod sursa(job #271145)
Utilizator | Data | 4 martie 2009 22:23:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <stdio.h>
int v[2000100];
int i,n,j,count;
int main ()
{
freopen ("ciur.in","r",stdin);
freopen ("ciur.out","w",stdout);
scanf ("%d",&n);
for (i=2;i<=n;i++)
if (v[i]==0) {
for (j=2*i;j<=n;j=j+i) v[j]=1;
count++;
}
printf ("%d",count);
return 0;
}