Python求最大公約數和最小公倍數

實現代碼：

def myue(x, y):
    if x > y:
        smaller = y
    else:
        smaller = x

    for i in range(1, smaller + 1):
        if ((x % i == 0) and (y % i == 0)):
            myue = i
    return  myue
num1 = int(input("輸入第一個數字: "))
num2 = int(input("輸入第二個數字: "))
print(num1,"和",num2, "的最大公約數爲", myue(num1, num2))
print(num1,"和",num2,"的最小公倍數爲",num1*num2/myue(num1,num2))

運行演示：