Node.js) 백준 2609번 : 최대공약수와 최소공배수

https://www.acmicpc.net/problem/2609

2609번: 최대공약수와 최소공배수

const fs = require('fs');
const input = fs.readFileSync("./dev/stdin").toString().trim().split(" ");

const nums = input.map(v => +v);
const gcd = Euclidean(nums[0], nums[1])
console.log(gcd)
const lcm = LCM(gcd, nums[0], nums[1])
console.log(lcm)

function Euclidean(a, b) {
  let x;
  let y;
  if (a > b) {
    x = a; y = b;
  } else {
    x = b; y = a;
  }
  let r;
  while (y != 0) {
    r = x % y;
    x = y;
    y = r;
  }
  return x;
}

function LCM(gcd, a, b) {
  return (a * b / gcd);
}