how does gcd work c++?
The Greatest Common Divisor (GCD) of two numbers is the largest number that divides both of them. For example: Let's say we have two numbers are 45 and 27. So, the GCD of 45 and 27 is 9.