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

由欧几里得，连续整数检测，分解质因数算法得最大公约数，并分析各种算法的时间性-By the Euclid, consecutive integers detection, decomposition of the prime factors have the greatest common divisor algorithm, and analyze the timing of various algorithms