Problem B15 · Easy

Euclidean Algorithm: Reduce by Remainders

Compute the greatest common divisor of two nonnegative integers, at least one positive.

Open the interactive visualisation