Calculate the maximum common divisor and least common multiple of two numbers.

Source: Internet
Author: User

// 3. Enter two numbers to calculate the maximum common number and the minimum common number.

IntA = 0, B = 0;

Printf("Enter two numbers :");

Scanf("% D", & A, & B );

IntC = 0, D = 0;

C = A> B? B:;// Obtain the smaller values of the two numbers

D = A> B? A: B;// Obtain the larger values of the two numbers

For(IntI = C; I> 0; I --){// Starts from a small cycle

If(C % I = 0) & (d % I = 0 )){// Judgment based on division time

Printf("Maximum common approx.: % d", I );

Printf("\ N least public multiple: % d", C * D/I );// Directly calculate the maximum times

Break;

}

}


This article from "a long time back to one" blog, please be sure to keep this source http://lulun426.blog.51cto.com/9197884/1540290

Contact Us

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.