Cod sursa(job #592035)
Utilizator | Data | 26 mai 2011 14:50:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <stdio.h>
long n, v[2000000], nr=0;
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
for (long i=2; i<=n; ++i)
v[i]=1;
for (long i=2; i<=n; ++i)
{
if ( v[i] )
{
++nr;
for (int j=i+i; j<=n; j += i)
v[j]=0;
}
}
printf("%d\n", nr);
return 0;
}