Cod sursa(job #287053)
Utilizator | Data | 24 martie 2009 15:16:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
var n,i,j,r:integer;
begin
assign(input,'ciur.in');reset(input);
assign(output,'ciur.out');rewrite(output);
readln(n);
for i:=1 to n do begin
for j:=1 to i div 2 do
if i mod j>0 then inc(r);
end;
write(r);
close(input);close(output);
end.