Cod sursa(job #176436)
Utilizator | Data | 11 aprilie 2008 11:39:23 | |
---|---|---|---|
Problema | Fractii | Scor | 20 |
Compilator | fpc | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
var
f:text;
n,p,q,k:longint;
phi:array[1..10000] of longint;
begin
assign(f,'fractii.in');
reset(f);
readln(f,n);
close(f);
phi[1]:=1;
for p:=2 to n do
phi[p]:=p-1;
for p:=2 to n do
begin
q:=2*p ;
while q<=n do
begin
phi[q]:=phi[q]-phi[p];
q:=q+p;
end;
end;
k:=1;
for p:=2 to n do
k:=k+(2*phi[p]);
assign(f,'fractii.out');
rewrite(f);
write(f,k);
close(f);
end.