辗转相除法求两个数的最大公约数与最小公倍数。
#include<iostream>
#include<algorithm>
using namespace std;
int common_multiple(int number1,int number2);
int main(){
int multiple,number1,number2;
cin>>number1>>number2;
multiple=common_multiple(number1,number2);
printf("%d",multiple); //输出最小公倍数
return 0;
}
int gcd(int number1,int number2){ //求number1和number2的最大公约数
if(number2==0) return number1;
else return gcd(number2,number1%number2);
}
int common_multiple(int number1,int number2){
int num=gcd(number1,number2);
return number1*number2/num;
}