Pagini recente » Cod sursa (job #2557408) | Cod sursa (job #229018) | Cod sursa (job #1526556) | Cod sursa (job #2454935) | Cod sursa (job #2326562)
var f,g:text;
P,Q,N,a,b:longint;
k:real;
C:array[1..1000000,1..1000000] of byte;
begin
assign(f,'fractii.in');
assign(g,'fractii.out');
reset(f);
rewrite(g);
read (f,N);
for P:=1 to N do
for Q:=1 to N do
if (Q mod 2 =0) or (P mod 2 =0) then C[P,Q]:=0
else C[P,Q]:=1;
k:=0;
for P:=1 to N-2 do
for Q:=P+1 to N do
if C[P,Q]=1 then
begin
a:=P;
b:=Q;
while (a<>b) do
if (a<b) then b:=b-a
else a:=a-b;
if (a=1)and(b=1) then k:=k+1;
end;
k:=2*k+1;
write (g,k:0:0);
close(f);
close(g);
end.