Cod sursa(job #585069)
| Utilizator | Data | 27 aprilie 2011 22:05:50 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.36 kb |
#include <stdio.h>
int c[2000001],j,n,i,nr;
int main(void)
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
nr=1;
for (i=3;i<=n;i+=2)
{
if (c[i]==0)
{
nr++;
for (j=i*i;j<=n;j+=i)
c[j]=1;
}
}
printf("%d",nr);
return 0;
}
