in C++

Euclid's algorithm is based on applying repeatedly the equality gcd(m, n) = gcd(n, m mod n), where m mod n is the remainder of the division of m by n, until m mod n is equal to 0. Write a program to implement Euclid's algorithm to find the following: 1. Minimum number of divisions made by Euclid's algorithm among all inputs 1 s m, n