lcm

Your mission

Write a function that computes the least common multiple of two unsigned integers.

See it in action

lcm(4, 6)

Expected result

Your checklist

For your own tracking. Tests grade your code.

If either argument is 0, return 0.
Otherwise return the smallest positive integer that is divisible by both a and b.
A common approach: lcm(a, b) = a / gcd(a, b) * b to reduce overflow risk.
The prototype is unsigned int lcm(unsigned int a, unsigned int b);.

More examples

lcm(5, 7)

Expected result

lcm(0, 5)

Expected result

Constraints

Expected files

lcm.c

Allowed functions

None. Write every helper yourself.

lcm

Functions

Your mission

Write a function that computes the least common multiple of two unsigned integers.

See it in action

lcm(4, 6)

Expected result

Your checklist

For your own tracking. Tests grade your code.

If either argument is 0, return 0.
Otherwise return the smallest positive integer that is divisible by both a and b.
A common approach: lcm(a, b) = a / gcd(a, b) * b to reduce overflow risk.
The prototype is unsigned int lcm(unsigned int a, unsigned int b);.

More examples

lcm(5, 7)

Expected result

lcm(0, 5)

Expected result

Constraints

Expected files

lcm.c

Allowed functions

None. Write every helper yourself.

Tests

Run the tests to grade your code

Build your code, then check each test here. Open a result to inspect its output.

Build

01LCM of 4 and 6Waiting

02LCM of 5 and 7Waiting

03LCM of 12 and 18Waiting

04LCM is 0 when one value is 0Waiting

05LCM of equal values equals that valueWaiting

06LCM of 1 and 9Waiting

lcm

Your mission

Write a function that computes the least common multiple of two unsigned integers.

See it in action

lcm(4, 6)

Expected result

Your checklist

For your own tracking. Tests grade your code.

If either argument is 0, return 0.
Otherwise return the smallest positive integer that is divisible by both a and b.
A common approach: lcm(a, b) = a / gcd(a, b) * b to reduce overflow risk.
The prototype is unsigned int lcm(unsigned int a, unsigned int b);.

More examples

lcm(5, 7)

Expected result

lcm(0, 5)

Expected result

Constraints

Expected files

lcm.c

Allowed functions

None. Write every helper yourself.

lcm

Functions

Your mission

Write a function that computes the least common multiple of two unsigned integers.

See it in action

lcm(4, 6)

Expected result

Your checklist

For your own tracking. Tests grade your code.

If either argument is 0, return 0.
Otherwise return the smallest positive integer that is divisible by both a and b.
A common approach: lcm(a, b) = a / gcd(a, b) * b to reduce overflow risk.
The prototype is unsigned int lcm(unsigned int a, unsigned int b);.

More examples

lcm(5, 7)

Expected result

lcm(0, 5)

Expected result

Constraints

Expected files

lcm.c

Allowed functions

None. Write every helper yourself.

Tests

Run the tests to grade your code

Build your code, then check each test here. Open a result to inspect its output.

Build

01LCM of 4 and 6Waiting

02LCM of 5 and 7Waiting

03LCM of 12 and 18Waiting

04LCM is 0 when one value is 0Waiting

05LCM of equal values equals that valueWaiting

06LCM of 1 and 9Waiting