【囤】最小公倍数和最大公约数
int getLCM(int num1, int num2) { //求最小公倍数 int r; if (num1 < num2) { int temp = num1; num1 = num2; num2 = temp; } int m = num1; int n = num2; while ((r = m % n) != 0) { m = n; n = r; } return abs(num1 * num2 / n); } int getGCD(int num1, int num2) { //求最大公约数 int m, n, r; if (num1 < num2) { int temp = num1; num1 = num2; num2 = temp; } m = num1; n = num2; while((r = m % n) != 0) { m = n; n = r; } return abs(n); }