Cod sursa(job #195226)
| Utilizator |  Procopliuc Adrian Procopliuc |
Data | 16 iunie 2008 23:48:04 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.32 kb |
# include <stdio.h>
# include <math.h>
long int i,n,k,j;
char a[30010];
int main ()
{
freopen ("ciur.in","r",stdin);
freopen ("ciur.out","w",stdout);
scanf ("%li",&n);
for (i=1;i<=n;i++)
a[i]='0';
for (i=2;i<=n;i++)
if (a[i]=='0')
{
k++;
for (j=i+i;j<=n;j=j+i)
a[j]='1';
}
printf ("%li",k);
return 0;
}
