Python 最小公倍数算法
Python 3 教程
· 2019-02-12 13:43:21
以下代码用于实现最小公倍数算法：
实例(Python 3.0+)
# Filename : test.py
# author by : www.codercto.com
# 定义函数
def lcm(x, y):
# 获取最大的数
if x > y:
greater = x
else:
greater = y
while(True):
if((greater % x == 0) and (greater % y == 0)):
lcm = greater
break
greater += 1
return lcm
# 获取用户输入
num1 = int(input("输入第一个数字: "))
num2 = int(input("输入第二个数字: "))
print( num1,"和", num2,"的最小公倍数为", lcm(num1, num2))
执行以上代码输出结果为：
输入第一个数字: 54 输入第二个数字: 24 54 和 24 的最小公倍数为 216
点击查看所有 Python 3 教程 文章: https://codercto.com/courses/l/10.html
An Introduction to the Analysis of Algorithms
Robert Sedgewick、Philippe Flajolet / Addison-Wesley Professional / 1995-12-10 / CAD 67.99
This book is a thorough overview of the primary techniques and models used in the mathematical analysis of algorithms. The first half of the book draws upon classical mathematical material from discre......一起来看看 《An Introduction to the Analysis of Algorithms》 这本书的介绍吧!
