Cod sursa(job #154279)
| Utilizator |  Capalna Tanase Tase_C |
Data | 11 martie 2008 07:37:00 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
var v:array[1..2000000] of byte;
i,n,j:longint;
begin
assign(input,'ciur.in');reset(input);
assign(output,'ciur.out');rewrite(output);
read(n);
for i:=2 to trunc(sqrt(n)) do
if v[i]=0 then for j:=2 to n div i do v[i*j]:=1;
j:=0;
for i:=2 to n-1 do
if v[i]=0 then inc(j);
writeln(j);
close(input);close(output);
end.
