Cod sursa(job #584517)
Utilizator | Data | 25 aprilie 2011 18:26:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
var g,n,i,j:longint;
ciur:array[1..64000]of 0..1;
begin
assign(input,'ciur.in');reset(input);
assign(output,'ciur.out');rewrite(output);
read(n);
for i:=1 to n do
ciur[i]:=1;
for i:=2 to n div 2 do
for j:=2 to n div i do
ciur[i*j]:=0;
for i:=2 to n do
if ciur[i]=1 then inc(g);
write(g);
end.