Module: GCD (Greatest Common Divisor)


Problem

4/10

NOC (C++)

Problem

Find the least common multiple (LCM) of two natural numbers.
 
Input
The input is two natural numbers not exceeding 109 and separated by one space.
 
Output
Print the LCM of two numbers.

Paste the missing piece of code into the program.

Examples
# Input Output
1 16 20  80

time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Insert the missing code snippets
C++
Write the program below 
#include <iostream>
using namespace std;

int gcd (int a, int b) {
	return b ? gcd (b, a % b) : a;
}

int lcm (int a, int b) {   
}

int main()
{   
   
   int a,b; 
    cin >> a>>b;
    cout<<lcm(a,b);
    return 0;
}

     

Program check result

To check the solution of the problem, you need to register or log in!