baekjoon - python - 2609

https://www.acmicpc.net/problem/2609

2609번: 최대공약수와 최소공배수

# @Author YoungMinKim
# baekjoon
def gcd(a,b):
    if a<b:
        a,b=b,a
    while b!=0:
        a,b= b,a%b
    return a
def lcm(a,b):
    return a*b // gcd(a,b)
a,b=map(int,input().split())
print(gcd(a,b))
print(lcm(a,b))