1 // https://en.wikipedia.org/wiki/Least_common_multiple 2 // https://en.wikipedia.org/wiki/Greatest_common_divisor 3 // https://en.wikipedia.org/wiki/Euclidean_algorithm 4 5 #include <iostream> 6 7 int find_gcd(int a, int b) { 8 if(!b) 9 return a; 10 11 return find_gcd(b, a % b); 12 } 13 14 int find_lcm(int a, int b) { 15 return (a * b) / find_gcd(a, b); 16 } 17 18 int main (void) { 19 int a, b, lcm, gcd; 20 21 std::cin >> a; 22 std::cin >> b; 23 24 lcm = find_lcm(a,b); 25 gcd = find_gcd(a,b); 26 27 std::cout << "a=" << a 28 << "\tb=" << b << std::endl 29 << "lcm=" << lcm << std::endl 30 << "gcd=" << gcd << std::endl; 31 return 0; 32 }
