index
| submit
| rank
| book

## lcm – Least Common Multiple (LCM)

Write a program that
computes the least common multiple (LCM) of two integers.

Here are a few examples:

- the least common multiple of 12 and 18 is 36;
- the least common multiple of 100 and 60 is 300;
- the least common multiple of 8 and 10 is 40.

### Input and Output

Input will contain multiple lines
each with two integers *m* and *n* in the range:

*0 < m, n < 1 000 000*

For each line of input your program should produce a line of output with the LCM of *m* and *n*.

Input is given so that the resulting LCM should be less than 1 000 000 000.

#### Example input

```
12 18
100 60
8 10
```

### The `lcm`

function

Your program should be implemented using a `lcm`

function
that receives two integers as arguments and returns an integer.
Please refer to the information for the chosen language:

- C prototype:
`int lcm(int x, int y);`

- Python definition:
`def lcm(x,y):`

- Haskell type:
`lcm :: Int -> Int -> Int`

with `import Prelude hiding (lcm)`

- C++ prototype:
`int lcm(int x, int y);`

- C# definition:
`public static int LCM(int a, int b)`

in a public class `Program`

- Java definition:
`public static int lcm(int a, int b)`

in a public class `LCM`

- JavaScript definition:
`function lcm(a, b)`

- Lua definition:
`function lcm (a, b)`

- Ruby definition:
`def lcm(a, b)`

### Scoring

Submit your solution to be graded according to the following list:

- 1/6: works for the above example but produces output in an incorrect format
- 2/6: works for the above example and produces output in the correct format
- 3/6: works for other test cases
- 4/6: works for edge cases
- 5/6: has good performance
- 6/6: implements the
`lcm`

function

### Hints

Can you reuse your code from the gcd exercise?

try first: gcd

try next: primes roundiv

index
| submit
| rank
| book

Copyright © 2020-2023 Rudy Matela

All rights reserved