最大公约数、最小公倍数python实现

    技术2025-01-20  47

    """ @Author : 侬&码 """ from functools import reduce num1 = 1125 num2 = 855 mi = min(num1, num2) print(mi) li = [] count = 0 while True: for i in range(2, mi + 1): if num1 % i == 0 and num2 % i == 0: num1, num2 = num1 // i, num2 // i mi = min(num1, num2) li.append(i) break count += 1 else: break p1 = reduce(lambda x, y: x * y, li) print(f'最大公约数:{p1},最大公倍数:{p1 * num1 * num2}') print('执行内循环次数:', count)
    Processed: 0.010, SQL: 9