1065. Minimum Public multiple, 1065 minimum public multiple

Source: Internet
Author: User

1065. Minimum Public multiple, 1065 minimum public multiple

Enter a positive integer n, m, and write a program to calculate the minimum public multiples of n and m. Enter a positive integer n, m separated by two spaces in a row. Minimum Public multiple of output n and m. Sample Input
12 18
Sample output
36
Data range: 1 <= n, m <= 10 ^ 6
1 # include <cstdio> 2 # define ll long 3 using namespace std; 4 long int a, B; 5 long int f (long int, long int B) 6 {7 return (a % B = 0 )? B: f (B, a % B); 8} 9 int main () 10 {11 scanf ("% lld", & a, & B ); 12 ll int gcd = f (a, B); 13 ll int ans = (a * B)/gcd; 14 printf ("% lld", ans); 15 return 0; 16}

 

Related Article

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.