Question

задача пять!!СРОЧНО
паскаль​

Answer 1

function GCD(a, b: integer): integer;

begin

 while b <> 0 do

 begin

   a := a mod b;

   Swap(a, b)

 end;

 result := a

end;

begin

 var (m, n) := ReadInteger2();

 var gcd_ := GCD(m, n);

 var lcm_ := m * n div gcd_;

 for var i := 1 to gcd_ do

   Print(lcm_ * i)

end.