Cute_ Panda 🐼 就業了，Still 窮。 => Ubuntu 台灣社群: def gcd(a, b): if max(a, b) % min(a, b) == 0: return min(a, b) else: return compute(min(a, b), max(a, b) % min(a, b)) def lcm(a, b): return a * b / gcd(a, b) def compute(a, b, c, d): m = lcm(b, d) c = a * (m / b) + c * (m / d) i = gcd(m, c) return c / i, m / i print(compute(1, 2, 1, 6)) #63622470d97c9d19b3414e5e

Cute_ Panda 🐼 就業了，Still 窮。 says to Ubuntu 台灣社群

def gcd(a, b): if max(a, b) % min(a, b) == 0: return min(a, b) else: return compute(min(a, b), max(a, b) % min(a, b)) def lcm(a, b): return a * b / gcd(a, b) def compute(a, b, c, d): m = lcm(b, d) c = a * (m / b) + c * (m / d) i = gcd(m, c) return c / i, m / i print(compute(1, 2, 1, 6))

at Wed, Nov 2, 2022 4:03 PM