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.
December 22, 2018
HomeExerciseLoopFind gCD, BCNN

Find gCD, BCNN

By Loop  1 Comment ☞ timesheets code
NOT IN HUE, MISSING than output. Read the instructions and code samples do post here if you're wrong or not know how to do

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!

NOT IN HUE, MISSING than output. Read the instructions and code samples do post here if you're wrong or not know how to do
One Comment
  1. SnakeTZZO

    #include
    int main(){
    int n, m, mxn;
    mxn = m * n;
    scanf(“%d%d”, &n, &m);
    while (m != n){
    if (m > n) m = m – n;
    else n = n – m;
    }
    printf(“%d %d”, m, mxn / m);
    return 0;
    }
    Em để tạm code ở đây ạ, giờ web đang bị lỗi.

Add a Comment