输入两个正整数m和n，求其最大公约数和最小公倍数。 利用辗除法。-Enter two positive integers m, n, of seeking the common denominator and least common multiple. The use of rolling division.

自动获得获得输入的数字的最大公约数最小公倍数-Enter the number of automatic access to the least common multiple greatest common divisor

求两个整数的最大公因子，求这两个整数的最小公倍数-maximum common factor and lease common multiple