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

Source: Internet
Author: User

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) =

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

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.

Related Keywords:

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

• Sales Support

1 on 1 presale consultation

• After-Sales Support

24/7 Technical Support 6 Free Tickets per Quarter Faster Response

• Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.