Cod sursa(job #1033232)
Utilizator | Data | 16 noiembrie 2013 16:55:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | fpc | Status | done |
Runda | cei_mici3 | Marime | 0.38 kb |
var a:array[1..4000000] of byte;
i,j,n,k:longint;
f,g:text;
begin
assign(f,'ciur.in');reset(f);
assign(g,'ciur.out');rewrite(g);
readln(f,n);
a[1]:=0;
for i:=2 to n do
a[i]:=1;
for i:=2 to n do
if a[i]=1 then
begin
k:=k+1;
j:=i+i;
repeat
a[j]:=0;
j:=j+i;
until j>n;
end;
writeln(g,k);
close(f);close(g);
end.