python中最小公倍数,python 最大公约数 最小公倍数

def gongyueshu(m,n):

if m

m,n=n,m

elif m==n:

return m

if m/n==int(m/n):

return n

else:

for i in range(n,0,-1):

if m/i==int(m/i) and n/i==int(n/i):

return i

def gongbeishu(m,n):

aa=[]

if m

m,n=n,m

elif m==n:

return m

while gongyueshu(m,n)!=1:

for i in range(2,int(n)+1):

if m/i==int(m/i) and n/i==int(n/i):

m=int(m/i)

n=int(n/i)

aa.append(i)

break

cc=1

for b in aa:

cc=b*cc

cc=cc*n*m

return cc

print(gongyueshu(18,3))

print(gongbeishu(18,3))

结果：

================== RESTART: D:\Python\Python37\gongyueshu1.py ==================

3

18

>>>

标签：aa,int,公倍数,18,gongyueshu,python,最大公约数,print,cc

来源： https://www.cnblogs.com/xkdn/p/14332641.html