這段代碼感受python的優雅和簡潔
# -*- coding: utf-8 -*-
# @Time:2020/8/18 0:02
# @Author:hanqi
# FileName:最大公約數和最小公倍數.py
# Software:PyCharm
def hcf(u, v):
"""該函數返回兩個數的最大公約數"""
# 交換u,v,保證u>v
if v > u:
u, v = v, u
t = u % v
while (t != 0):
u, v, t = v, t, u % v
return v
def lcd(u, v):
"""該函數返回兩個數的最小公倍數"""
return u * v // hcf(u, v)
num1 = int(input("請輸入第一個數字:"))
num2 = int(input("請輸入第二個數字:"))
print("最大公約數", hcf(num1, num2))
print("最小公倍數", lcd(num1, num2))
```python
結果正确。
源碼
我的女朋友
,更多精彩资讯请关注tft每日頭條，我们将持续为您更新最新资讯!
zpostcode 
Recruit 
weather 
mreligion 
Yellowpages 
sport 
constellation 
shopping 
name 
game 
directory 
literature 
Word 
tour 
furnish 
Lottery 
tftnews 
lyrics 
News 
digital 
car 
dir 
Edu 
Finance 
