Find the greatest common divisor of two numbers using the Euclidean algorithm. If the numbers are large, use divmod to calculate them.

About A collection of C/C++ code examples, including qsort, find the lcm of two numbers, find the greatest common divisor of two numbers.