Cod sursa(job #1244971)
Utilizator | Data | 18 octombrie 2014 14:42:13 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
var n,i,k,s:longint;f,g:text;
begin
assign(f,'fractii.in');reset(f);
assign(g,'fractii.out');rewrite(g);
read(f,n);
s:=n*(n-1) div 2;
write(s);
for i:=2 to n div 2 do begin
k:=2;
while i*k<=n do begin
if i*k<=n div 2 then s:=s+((k-1)*(i-1));
k:=k+1;
end;
s:=s-((k-2)*(i-1));end;
s:=s*2+1;
write(g,s);
close(f);
close(g);
readln;
end.