Cod sursa(job #153331)
Utilizator | Data | 10 martie 2008 14:10:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <stdio.h>
int main()
{
int np,i,j,n,nr;
int v[1010];
bool prim[2000010];
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for (i=0; i<=n+1; i++) prim[i]=0;
np=0;
for (i=2; i<=n; i++)
{
if (prim[i]==0)
{
np++;
for (j=i+i; j<=n; j+=i)
prim[j]=1;
}
}
printf("%d\n",np);
return 0;
}