Cod sursa(job #2228548)
Utilizator | Data | 4 august 2018 10:53:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <cstdio>
char p[2000010];
int sieve1(int n)
{
int i, j, nr = 0;
for(i = 2; i <= n; ++i)
{
if(p[i] == 0)
{
nr++;
for(j = i + i; j <= n; j += i)
{
p[j] = 1;
}
}
}
return nr;
}
main ()
{
freopen ("ciur.in", "r", stdin);
freopen ("ciur.out", "w", stdout);
int N; scanf("%d ", &N);
printf("%d", sieve1(N));
}