Cod sursa(job #165751)
Utilizator | Data | 26 martie 2008 19:01:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
# include <stdio.h>
# include <math.h>
int i,n,k,j;
char a[2000000];
int main ()
{
freopen ("ciur.in","r",stdin);
freopen ("ciur.out","w",stdout);
scanf ("%i",&n);
for (i=1;i<=n;i++)
a[i]='0';
for (i=2;i<=n;i++)
if (a[i]=='0')
{
k++;
for (j=i;j<=n;j=j+i)
a[j]='1';
}
printf ("%i",k);
return 0;
}