今天打算摆烂：Python实现那些烦人的题目

最新推荐文章于 2024-05-06 00:08:33 发布

AICodeThunder

最新推荐文章于 2024-05-06 00:08:33 发布

阅读量143

点赞数 1

文章标签： python 开发语言

本文链接：https://blog.csdn.net/joe_g12345/article/details/136543826

版权

一、约分

def gcd(a, b):
    while b != 0:
        a, b = b, a % b
    return a

def to_fraction(num, den):
    if den == 0:
        return None
    if num == 0:
        return 0, 1
    sign = (num < 0) ^ (den < 0)
    num, den = abs(num), abs(den)
    g = gcd(num, den)
    num //= g
    den //= g
    whole = num // den
    num %= den
    if sign:
        whole *= -1
    return whole, num, den

def simplify_fraction(whole, num, den):
    if num == 0 or den == 0:
        return whole, num, den
    g = gcd(num, den)
    num //= g
    den //= g
    if num >= den:
        whole += num // den
        num %= den
    return whole, num, den

def simplify_mixed_fraction(whole, num, den):
    if num == 0 or den == 0:
        return whole, num, den
    if whole < 0:
        num *= -1
    if num < 0:
        sign = -1
        num = abs(num)
    else:
        sign = 1
    return simplify_fraction(whole, sign * num, den)

whole, num, den = to_fraction(7, 2)   # 输入7/2
whole, num, den = simplify_mixed_fraction(whole, num, den)   # 化简为最简真分数
print(f"{whole} {num}/{den}")   # 输出3 1/2

二、最大公因数、最小公倍数

def gcd(a, b):
    while b != 0:
        a, b = b, a % b
    return a

def lcm(a, b):
    return abs(a * b) // gcd(a, b)

num1 = 24
num2 = 36
gcd_result = gcd(num1, num2)   # 求最大公因数
lcm_result = lcm(num1, num2)   # 求最小公倍数
print(f"最大公因数：{gcd_result}")
print(f"最小公倍数：{lcm_result}")