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