python-求最大公约数和最小公倍数

def gcd(x, y):
    """求最大公约数"""
    gcd1 = []
    gcd2 = []
    gcd3 = []
    for i in range(1, x+1):
        if x % i == 0:
            gcd1.append(i)
    for i in range(1, y+1):
        if y % i == 0:
            gcd2.append(i)
    for i in range(len(gcd1)):
        if gcd1[i] in gcd2:
            gcd3.append(gcd1[i])
    return max(gcd3)


def lcm(x, y):
    """求最小公倍数"""
    if x < y:
        flag = x
    else:
        flag = y
    while True:
        if flag % x == 0 and flag % y == 0:
            return flag
        else:
            flag += 1


if __name__ == '__main__':
    x1 = int(input())
    y1 = int(input())
    print(gcd(x1, y1))
    print(lcm(x1, y1))