第18题：逆解最大公约数与最小公倍数

def is_max_divisor(a,b,c): #a是最大公因数 b&c是两个输入的数
    min_one = min(b,c)
    for i in range(a+1,min_one+1):
        if b % i == 0 and c % i == 0:
            return False
    return True
def is_min_mul(a,b,c): #a是最小公倍数， b&c是两个输入的数
    max_one = max(b,c)
    for i in range(max_one, a):
        if i % b == 0 and i % c == 0:
            return False
    return True
def middle2(common_divisor, max_mul):
    a = max_mul // common_divisor
    sum = 2*max_mul
    for i in range(1,a+1):
        for j in range(1,a+1):
            if is_max_divisor(common_divisor, common_divisor * i, common_divisor * j) and is_min_mul(max_mul,common_divisor * i, common_divisor * j):
                if sum > common_divisor*(i+j):
                    sum = common_divisor*(i+j)
                    a1 = common_divisor * i
                    a2 = common_divisor * j
    empty_list = []
    empty_list.append(a1)
    empty_list.append(a2)
    return empty_list

a = middle2(a,b)
print(' '.join(str(i) for i in a))