#include<bits/stdc++.h>
#define ll long long
using namespace std;
/*
ll gcd(ll a, ll b) {//非递归版
ll t;
while(b) {
t = a % b;
a = b;
b = t;
}
return a;
}
*/
ll gcd(ll a, ll b) {//递归版
if(b == 0)return a;
else return gcd(b, a % b);
}
int main() {
ll a, b;
cin >> a >> b;
ll r = gcd(a, b);
cout << r << endl;//最大公约数
cout << a * b / r << endl;//最小公倍数
return 0;
}
数论---GCD(最大公约数)+LCM(最小公倍数)
猜你喜欢
转载自blog.csdn.net/m0_37444209/article/details/80527485
今日推荐
周排行