ancient Euklid
Greatest common divisor calculator. The program uses the ancient Euclidean algorithm based on subtraction to find and display the greatest common divisor of two integers.
try console
To try the program, enter a value into STDIN first, then click the
Run button.
Enter two positive integers separated by spaces (e.g., 3 483).
There are some limitations in the mobile version of the compiler.
For the full experience, please use a PC.