#输入两个正整数m和n，求其最大公约数和最小公倍数

__author__ = 'zhouhai'


#输入两个正整数m和n，求其最大公约数和最小公倍数


if  __name__ == '__main__':
    number1_input = input("请输入第一个正数：")
    number2_input = input("请输入第二个正数：")
    if(number1_input.isdigit() == False or number2_input.isdigit()==False):
        number1_input = input("输入有误，请输入第一个正数：")
        number2_input = input("请输入第二个正数：")


    number1 = int(number1_input)
    number2 = int(number2_input)
    #先比较数值大小
    small_num = number1
    if number1 > number2:
        small_num = number2


    while number1%small_num != 0 or number2%small_num != 0 and small_num > 0:
        small_num = small_num - 1




    greatest_divisor = small_num
    least_common_multiple = int(number1*number2/greatest_divisor)


    print("%d和%d的最大公约数：%d"%(number1,number2,greatest_divisor))
    print("%d和%d的最小公倍数：%d"%(number1,number2,least_common_multiple))