Cod sursa(job #1603681)
| Utilizator | Data | 17 februarie 2016 18:37:09 | |
|---|---|---|---|
| Problema | Fractii | Scor | 90 |
| Compilator | fpc | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
var i,j,n:longword;
sum:qword;
ph:array[1..2000001] of int64;
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;
while j<=n do
begin
ph[j]:=ph[j]-ph[i];
j:=j+i;
end;
end;
sum:=1;
for i:=1 to n do sum:=sum+(2*ph[i]);
assign(output,'fractii.out'); rewrite(output);
write(output,sum); close(output);
end.
