Cod sursa(job #175023)
Utilizator | Data | 9 aprilie 2008 15:08:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
var i,j,n,nr:longint;
v:array[1..2000001] of 0..1;
begin
assign(input,'ciur.in'); reset(input);
assign(output,'ciur.out'); rewrite(output);
readln(n);
for i:=2 to n do v[i]:=1;nr:=0;
for i:=2 to n do
if v[i]=1 then
begin
inc(nr);
j:=2*i;
while (j<=n) do
begin
v[j]:=0;
j:=j+i;
end;
end;
writeln(nr);
close(output);
close(input);
end.