WEBSITE RETURNED, HOWEVER SUBMIT QUANTITY IS RESTRICTED PER DAY TO VERY LITTLE (UNDER JUDGE0 NEW POLICY, API PROVIDER). Therefore it is very much for you to pay attention TEST CAREFULLY CODE BEFORE SUBMIT.

Find gCD, BCNN

Threads: Input 2 integer. Find the greatest common divisor (UCLN) and the least common multiple (BCNN) of them.
Input: A line of 2 positive integers separated by spaces.
Output: A line of 2 numbers separated by spaces that GCD, BCNN of 2 Some have.
For example:

input:
6 4
output:
2 12

You are not logged in? Log in to Submit Now!

One Comment

Add a Comment