def gcd(m, n):
if n == 0:
m, n = n, m
while m != 0:
m, n = n%m, m
return n
Python Tricks(十三)—— 欧几里得算法
最新推荐文章于 2022-06-04 17:50:56 发布
def gcd(m, n):
if n == 0:
m, n = n, m
while m != 0:
m, n = n%m, m
return n