题解 | #求最小公倍数#
求最小公倍数
https://www.nowcoder.com/practice/22948c2cad484e0291350abad86136c3
a=input().split()
n=int(a[0])
m=int(a[1])
b=[]
if n>=m:
k=m
else:
k=n
for i in range(2,k+1):
while(n%i==0 and m%i==0):
b.append(i)
n=int(n/i)
m=int(m/i)
b.append(n)
b.append(m)
count=1
for i in range(len(b)):
count=count*b[i]
print(count)
