欧几里德算法：辗转求余　　原理: gcd(a,b)=gcd(b,a mod b)　　当b为0时,两数的最大公约数即为a　　getchar()会接受前一个scanf的回车符-Euclidean algorithm: Principles of travel for more than: gcd (a, b) = gcd (b, a mod b) when b is 0, the two common denominator is the number of a getchar () will ac

求两个数m和n的最大公约数和最小公倍数。求出100—200之间所有的素数，要求一行打印5个。-Find greatest common divisor and least common multiple of two numbers n and m. Find all primes between 100-200, request line prints 5

使用c语言编写程序求两个数的最小公倍数和最大公约数(The least common multiple and the greatest common divisor and the number two)