广义欧几里得算法，用以计算两个数的最大公约数，依靠定理定理：gcd(a,b) = gcd(b,a mod b)-Generalized Euclidean algorithm for computing the greatest common divisor of two numbers, relying on Theorem Theorem: gcd (a, b) = gcd (b, a the mod b)