Leetcode 2169. Count Operations to Obtain Zero

Repeatedly subtract the smaller of two nonnegative integers from the larger (or subtract one from the other if equal) until one becomes zero, and return the total number of subtractions performed. This is essentially counting repeated subtractions and can be viewed as accelerated division/modulo steps similar to the Euclidean algorithm.