Question

Given 2 non negative integers m and n, find gcd(m, n) gcd of 2 integers m and n is defined as the greatest integer g such that g is a divisor of both m and n. Both m and n fit in a 32 bit signed integer.

Answer 1

Step-by-step explanation:

cruxrebels/GreatestCommonDivisor. cpp Given 2 non negative integers m and n, find gcd(m, n) GCD of 2 integers m and n is defined as the greatest integer g such that g is a divisor of both m and n. Both m and n fit in a 32 bit signed integer