Question 1133: Minimum Public multiple

Given two positive integers, this topic describes the minimum public multiples of these two numbers. The input contains multiple groups of test data. Each group has only one row, including two positive integers not greater than 1000. The output is the minimum public multiple of the two numbers for each test case. Each instance outputs a row. Sample input 20 15 sample output 60 prompt [+] *** prompt hidden, click [+] at the top to display the *** source simple mathematical question [cpp]/************************* * ********** Date: * Author: SJF0115 * question: Question 1133: least common factor * Source: http://ac.jobdu.com/problem.php? Pid = 1133 * result: AC * Source: * conclusion: * *********************************/# include <stdio. h> int GCD (int a, int B) {if (B = 0) {return a;} else {return GCD (B, a % B );}} int main () {int a, B, c; while (scanf ("% d", & a, & B )! = EOF) {// maximum common approx. c = GCD (a, B); printf ("% d \ n", a * B/c );} // while return 0 ;}