题解 | #小乐乐与欧几里得#
小乐乐与欧几里得
https://www.nowcoder.com/practice/da13e0cf321e4df9acd0fdf0a433cbb0
n, m = map(int, input().split())
def gcd(a,b):
while b != 0:
a, b = b, a%b
return a
def lcm(a,b):
return abs(a*b)//gcd(a,b)
print(gcd(n,m) + lcm(n, m))
