最大公约数、最小公倍数简单求法，无聊新手学习中-Greatest common divisor, least common multiple simple method, bored novice learning

此包包含了两个小程序，包含了计算两个数的最小公倍数和最大公约数的程序。-This package contains two procedures, including procedures for computing the least common multiple and greatest common divisor of two numbers.

输入两个正整数m和n，求其最大公约数和最小公倍数。利用辗除法。程序源代码：-Import two positive integer m and N, seek the greatest common divisor and the least common multiple. The use of rolling division. Program source code: