辗转相除法的递归写法
#include<iostream>
using namespace std;
int gcd(int a, int b)
{
return b == 0 ? a : gcd(b, a % b);
}
int main()
{
while (1)
{
cout << "输入两个数:\n";
int a, b;
cin >> a >> b;
cout << a << " " << b << "的最大公约数是:" << gcd(a, b) << endl;
cout << a << " " << b << "的最小公倍数是:" << a * b / gcd(a, b) << endl;
}
return 0;
}