Description: 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)
To Search:
File list (Check if you may need any files):
广义欧几里得除法\BigNum.h
................\广义欧几里得除法.cpp
广义欧几里得除法
Download