Mai intai trebuie sa te autentifici.
Cod sursa(job #165745)
| Utilizator |  Procopliuc Adrian Procopliuc |
Data | 26 martie 2008 18:58:56 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.27 kb |
# include <stdio.h>
# include <math.h>
int i,n,k,j,a[30000000];
int main ()
{
freopen ("ciur.in","r",stdin);
freopen ("ciur.out","w",stdout);
scanf ("%i",&n);
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;
}