欧几里得算法,用来计算两个数的最大公约数。此算法，基于数论的偶记离得算法-Euclidean algorithm, used to calculate the greatest common divisor of two numbers. This algorithm, based on number theory even remember from the algorithm