Cod sursa(job #402396)
Utilizator | Data | 23 februarie 2010 20:35:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<stdio.h>
long nr,n;
char v[2000005];
int main()
{long i,j;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(i=2;i<=n;i++)
v[i]=1;
for(i=2;i<=n;i++)
if(v[i])
{nr++;
for(j=i+i;j<=n;j=j+i)
v[j]=0;
}
printf("%d",nr);
return 0
}