Cod sursa(job #387596)
Utilizator | Data | 27 ianuarie 2010 22:58:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<stdio.h>
char v[2000005];
long n,nr;
int main()
{
long long i,j;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%ld",&n);
for (i=2;i<=n;++i)
if (!v[i])
{
for (j=i*i;j<=n;j=j+i)
v[j]=1;
++nr;
}
printf("%ld\n",nr);
return 0;
}