최대공약수(GCD), 최소공배수(LCM)

[devLupin]

GCD

---

int gcd(int a, int b) {
    if (a % b == 0) return b;
    else return gcd(b, a % b);
}

[devLupin]

LCM

---

int lcm(int a, int b) {
    return (a * b) / gcd(a, b);
}