Sfida di programmazione: Least Common Multiple

Problema

Return the least common multiple of a and b, the smallest positive number that both divide. lcm(a, b) = a / gcd(a, b) × b.

Implement lcm(a, b).

a: The first positive number. b: The second positive number.

Return lcm(a, b).

1 ≤ a, b ≤ 1,000,000,000

Esempio 1

Input:
a = 4
b = 6

Output atteso:
expected = 12

Input:
long long a = 4;
long long b = 6;

Output atteso:
long long expected = 12;

Input:
long a = 4;
long b = 6;

Output atteso:
long expected = 12;

Multiples of 4: 4, 8, 12…; multiples of 6: 6, 12…; the first common one is 12.

Esempio 2

Input:
a = 7
b = 7

Output atteso:
expected = 7

Input:
long long a = 7;
long long b = 7;

Output atteso:
long long expected = 7;

Input:
long a = 7;
long b = 7;

Output atteso:
long expected = 7;

A number's LCM with itself is the number: 7.

Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.