Question

Implementations
in c++ programming when finding lcm and gcd in c++​

Answer 1

#include<iostream>

using namespace std;

int lcm(int m, int n) {

int a;

a = (m > n) ? m: n;

while (true) {

if (a % m == 0 && a % n == 0)

return a;

++a;

}

}

int gcd(int m, int n) {

int r = 0, a, b;

a = (m > n) ? m : n;

b = (m < n) ? m : n;

r = b;

while (a % b != 0) {

r = a % b;

a = b;

b = r;

}

return r;

}

int main(int argc, char **argv) {

cout << "Enter the two numbers: ";

int m, n;

cin >> m >> n;

cout << "The LCM of two numbers is: " << lcm(m, n) << endl;

cout << "The GCD of two numbers is: " << gcd(m, n) << endl;

return 0;

}

Step-by-step explanation: