最大公约数和最小公倍数最简单实现
假设A和B的最大公约数和最小公倍数分别为C和D:那么A*B=C*D
#include<stdio.h>
void main(){ /*辗转相除法求最大公约数*/
int m,n,b,a,c;
scanf("%d %d",&m,&n);
a = m;
c = n;
while(b){ //余数不为0,继续相除,直到余数为0
b = m%n;
m = n;
n = b;
}
printf("The largest common divisor:%d\n",m);
printf("The least common multiple:%d\n",a*c/m);
}