python中最小公倍数函数,Python 最小公倍数算法

可以借用前一个实例中求取最小公约数的代码来实现求解两个整数的最大公倍数，代码如下：

#!/usr/bin/python3

# -*- coding: UTF-8 -*-

# find the Least Common Multiple of two integer

def find_GCD(x, y):

find_GCD = y

while (x % y) != 0:

find_GCD = x % y

x, y = y, find_GCD

return find_GCD

def find_LCM(x,y):

return int(x * y / find_GCD(x, y))

int1 = int(input('Input 1st integer: '))

int2 = int(input('Input 2nd integer: '))

print('The least common multiple of {} and {} is {}'.format(int1, int2, find_LCM(int1, int2)))

代码运行结果如下：

Input 1st integer: 54

Input 2nd integer: 24

The least common multiple of 54 and 24 is 216

黄桃果捞

黄桃果捞

zhe***ao@126.com3年前 (2018-03-20)