Python/백준

[2609] 최대공약수와 최소공배수

류경혜 2022. 5. 30. 16:00

import math
a, b = map(int, input().split())
print(math.gcd(a, b))  # Greatest Common Divisor, 최대공약수
print(math.lcm(a, b))  # Least Common Multiple, 최소공배수