Write a recursive gcd function (Euclid's algorithm) and use it to compute the LCM. Read two numbers and print both.
#include <iostream>
long long gcd(long long a, long long b) {
return b == 0 ? a : gcd(b, a % b);
}
long long lcm(long long a, long long b) {
return a / gcd(a, b) * b; // divide first to avoid overflow
}
int main() {
long long a, b;
std::cin >> a >> b;
std::cout << "GCD = " << gcd(a, b) << ", LCM = " << lcm(a, b) << '\n';
return 0;
}
GCD = 12, LCM = 840
gcd(a, b) = gcd(b, a mod b) until b is 0. LCM × GCD = a × b; dividing before multiplying keeps intermediate values small.