Write a function that computes the greatest common divisor of four natural numbers @a@, @b@, @c@ and @d@ using the fast version of the Euclidean algorithm.
| C++,C | |
| Java | |
| Python | |
|
The four numbers are strictly greater than zero.
You only need to submit the required procedure; your main program will be ignored.
Using the function @gcd(a, b)@ of the exercise problem://problemsjutge.org:problems/p1/jpetit/mcd-iteratiu.pbm should be useful.
Input/Output