[C/C++ 演算法]- 最大公因數、最小公倍數、因數分解 – jashliao部落格

#include 
#include 

int gcd(int m, int n) {
while(n != 0) {
int r = m % n;
m = n;
n = r;
}
return m;
}
int lcm(int m, int n) {
return m * n / gcd(m, n);
}
int main(void) {
int m, n;
printf("輸入兩數：");
scanf("%d %d", &m, &n);
printf("Gcd：%d\n", gcd(m, n));
printf("Lcm：%d\n", lcm(m, n));
return 0;
}