Cod sursa(job #2482609)
Utilizator | Data | 28 octombrie 2019 17:39:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
var
n, i, j, b: integer;
var
is_prime: array[2..2000000] of boolean;
begin
read(n);
for i := 2 to n do is_prime[i] := true;
for i := 2 to n do
begin
if (is_prime[i])= true then
begin
inc(b);
for j := 2 to trunc(n div i) do is_prime[i * j] := false;
end;
end;
writeln(b);
end.