Files
python/TangDou/LanQiaoBei/LanQiaoBeiWhitePaper/13_GCD_LCM.cpp

21 lines
358 B
C++
Raw Normal View History

2025-08-30 18:35:01 +08:00
#include <bits/stdc++.h>
using namespace std;
int a, b;
//最大公约数,辗转相除法
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
//最小公倍数
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
int main() {
cin >> a >> b;
printf("%d,%d", gcd(a, b), lcm(a, b));
return 0;
}