1、辗转相除法(又称欧几里得)求最大公约数,顺便求最小公约数
#include<stdio.h>
int main(){
int fun(int bignum,int littlenum);
printf("请输入两个整数:例如:123 456\n");
int m,n;
scanf("%d %d",&m,&n);
int maxCommonDoubleNum = fun(m,n);
printf("%d 和 %d 的最大公倍数:%d\n",m,n,maxCommonDoubleNum);
printf("%d 和 %d 的 最小公倍数: %d\n",m,n,(m*n)/maxCommonDoubleNum);
}
int fun(int bignum,int littlenum){
int temp,r;
if (bignum <= littlenum){
temp = bignum;
bignum = littlenum;
littlenum = temp;
}
do{
r = bignum%littlenum;
bignum = littlenum;
littlenum = r;
}while(r != 0);
return bignum;
}