Node.js) 백준 1934번 : 최소공배수

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

1934번: 최소공배수

const fs = require('fs');
const input = fs.readFileSync("./dev/stdin").toString().trim().split("\n");
input.shift();
const nums = input.map(v => v.split(' ').map(v => +v))

nums.forEach(v => {
  console.log(lcm(v[0], v[1]))
})

function lcm(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 (a * b / x)
}