A good function (GCD) is used to calculate the least common number.

This function is a good one I accidentally saw. It is awesome and I like it.

Is used to find the minimum public approx.

A simple description is that gcd (a, B) indicates the maximum public factor of non-negative integers A and B, so: gcd (a, B) = gcd (B, A % B) or gcd (A, 0) = gcd (0, a) =

Please refer to the code

Int gcd (int A, int B)
{
If (A = 0)
Return B;
If (B = 0)
Return;
Return gcd (B, A % B );
}

Example Link

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1108

As the question is very simple, I will not talk much about it.

AC code

# Include <stdio. h>
Int main (void)
{
Int gcd (int A, int B );
Int A, B;
While (scanf ("% d", & A, & B) = 2)
{
Printf ("% d \ n", a * B/gcd (A, B); // the product of the maximum public factor and minimum public factor of two numbers is the product of two numbers.
}
Return 0;
}

Int gcd (int A, int B)
{
If (A = 0)
Return B;
If (B = 0)
Return;
Return gcd (B, A % B );
}

 

A good function (GCD) is used to calculate the least common number.