Cod sursa(job #399511)
Utilizator | Data | 20 februarie 2010 16:28:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
var i,j,n,k:integer;
v:array[1..2000000]of boolean;
f:text;
procedure ciur;
begin
k:=0;
fillchar(v,2000000,true);
for i:=2 to n do
if v[i]=true then begin inc(k);
j:=2*i;
while j<=n do
begin
v[j]:=false;
j:=j+i;
end;
end;
end;
begin
assign(f,'ciur.in');
reset(f);
readln(f,n);
close(f);
ciur;
assign(f,'ciur.out');
rewrite(f);
writeln(f,k);
close(f);
end.