Cod sursa(job #1603630)
| Utilizator | Data | 17 februarie 2016 18:15:53 | |
|---|---|---|---|
| Problema | Fractii | Scor | 30 |
| Compilator | fpc | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
var i,j,n,sum:longint;
ph:array[1..1000000] of longint;
begin
assign(input,'fractii.in'); reset(input);
read(input,n); close(input);
for i:=1 to n do ph[i]:=i-1;
for i:=2 to n do
begin
j:=2*i;
repeat
ph[j]:=ph[j]-ph[i];
inc(j,i);
until j>n;
end;
sum:=0;
for i:=1 to n do sum:=sum+ph[i];
sum:=sum*2+1;
assign(output,'fractii.out'); rewrite(output);
write(output,sum); close(output);
end.
