0 like 0 dislike
1.2k views

Write a program that asks the user to enter two integers, then calculates and displays their greatest common divisor (GCD) and their Least common multiple (LCM).

寫一個輸入兩個整數 輸出它們的最大公因數程式

Hint: Use Euclidean Algorithm

使用歐幾里得演算法

LCM:

In arithmetic and number theory, the least common multiplelowest common multiple, or smallest common multiple of two integers a and b, usually denoted by LCM(ab), is the smallest positive integer that is divisible by both a and b.

What is the LCM of 4 and 6?

Multiples of 4 are:

4, 8, 12, 16, 20, 24, 28, 32, 36, 40, 44, 48, 52, 56, 60, 64, 68, 72, 76, ...

and the multiples of 6 are:

6, 12, 18, 24, 30, 36, 42, 48, 54, 60, 66, 72, ...

Common multiples of 4 and 6 are simply the numbers that are in both lists:

12, 24, 36, 48, 60, 72, ....

So, from this list of the first few common multiples of the numbers 4 and 6, their least common multiple is 12.

 

Example input: 

12 28

Example output (first number is GCD, second number is LCM):

4 84

 

[Exam] asked in Midterm by (12.1k points)
ID: 36752 - Available when: 2017-11-15 14:10 - Due to: Unlimited
| 1.2k views

10 Answers

0 like 0 dislike
Hidden content!
#include <stdio.h>

int main(){
**** **** ** * ** * a,b;
* ** * ** ** * *** * * remain=0;
** * ** * * * ** * gcd;
** ** **** **** * * * * * i,j=1;
* *** **** ** * * * * t=0;

*** ***** ** * * ** * **** ** ** * *** **** *** **** *
* * * * **** *** * ** ***
* * * *** ** * ** **** gcd
** **** * ******
* ** * ** ** * *** * ***

*** * ***** * ** *** ** * * *** of a and b from range a to b
* * *** * *** * ** ** * = a; i <= b; i++){
* *** * * **** * * ** * * **** ***** * *** *** * ****** ***** ", i);

* *** * ** * * * * * ** *

* * *** * ** **** ** * 0;
}
answered by (-74 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Wrong output
Case 4: Wrong output
0 like 0 dislike
Hidden content!
#include ** ** **** * *
int main()
{
* * * * ** * **** n1, n2, i, gcd;

**** **** ** * ** **** **** * * ** *** * &n1, &n2);

** * ** ** * ** *** ** * ** **** i <= n1 ** ** ** * i <= n2; ++i)
* ***** *** * *
* * * ** **** *** ******** ****** ** ** ** n2%i==0)
** ** * *** *** **** ********** * **** = i;
**** * ** *** * ***
* ** ** * * * ** *** * ** ** * * gcd);
* ** * *** * *** ** * ** * 0;
}
45/100 answered by (-233 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Wrong output
Case 4: Wrong output
0 like 0 dislike
Hidden content!
#include<stdio.h>



int main(){
* * ** * ** *** * ** *** a,b,c,d,e,m,i;
** *** * * *** * * *** ** * * ** ** ***** *** * ***
** *** * **** * *
** **** * **** ***** ** *** * *

* * * ** *** * **** ** **
* * ** * ** *** **** * ** ** * ******
* ***** * * *** *** *** ***** * * * **
*** *** ****** **** **** ** * * ** ** * ** ****** *
    }
    if (a%b==0){
** * ******* ** *** * *** ****** *** * * * ** ******** * ******
    }


**** * **** ***** ** * ** ** ** * *
* * *** * * * * *** * *** ** * *** ******
* **** * *** * ******* *** ** * * **** ***** * *** ** * * ** * *****
** * * * * * * * * * * *** * ****** * * * ** ** ** * *** * * * * * * * %d",i);
* ** * * * * ** * * **** ******* * * ** *** * *** * **** ** ** * ** * ** *** *
*** * * * * * ** * * * * *** ** *** * * * **** *** *
* ***** *** * **** **** * ** ** * * *** *
    }


   return 0;
}
answered by (-32 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Wrong output
Case 4: Correct output
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Wrong output
Case 4: Correct output
0 like 0 dislike
Hidden content!
* ** * *** *** *
int main (){
int * * *
* * * * * * ** * *
** * ***** *** * * *** * *
* **** * * ***
*** *
* ** ** * **
else{
*** * ** ** * * *
}
}

return 0;
}
answered by (16 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Wrong output
Case 4: Wrong output
0 like 0 dislike
Hidden content!
* ** * ** ***** *
int main(void){
int * ** * ** **
** * *** ** ********* * ** ***
***** ******* *** * * * ****
{
* ** ** ** * ** **** ** ***** ** * * *
*** *** * *** ** * * **
}
lcm=n*n2/gcd;
***** * * * * ***
return 0;

}
answered by (-167 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Correct output
0 like 0 dislike
Hidden content!
#include <stdio.h>
#include <stdlib.h>

int main()
{
******* * * *** **** *** num1;
** *** ** * *** ***** * * num2;
*** ****** * * *** ** remainder;
** * *** *** ** * *** numerator;
* * ** * *** ** * ** denominator;
** ****** * ****** * * gcd, lcm;


**** **** **** * ** **** ** ****** *** * * * * ** * **

* *** * * *** ** * * ** * **
* ** *** * *** * * *****
* * * ** * * * * ** ** **** * * ** * ** * ** * *
*** * ** * * * *** * * ** * ** * ** **
    }

* * * ** * ******* * *
*** * * * ***** * *** *** ** * ** *
* * *** *** * * *** * * **** ****** * * * ** * **
* ** ** ** * *** * *** * * * * ** ** *** * *
    }

* ******** * ******* * * *** *** *** *

* * ** * * * * ** ** * ** * * * != 0)
    {
* * ** * **** * * * * * *** * * * * **
* ***** * ** ***** * * * * *** ** * ** ** * * * *
** * * *** * *** ** *** ** * ***** * * ** **** * ***

    }

** * *** *** ** * *** * * ** **
* * * *** * * *** ** *** * *

**** * * * ** ** * * ** ** ",gcd);
* * * ** * *** * **** *** * * *** ***

* ** ** ** * * * ****** ** ** 0;
}
answered by (-193 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Correct output
0 like 0 dislike
Hidden content!
* *** * ****
int main()
{
int a,b,i,n,gcd,lcm;
*** *** ** * **** **
* ****** *
{
*** ***** * **** ***** ** * ** *
** * ** * * **** * * * ** *** *** ** ** * ** **
}
lcm=a*b/gcd;
*** ** * * ** *
return 0;
}
answered by (-32 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Correct output
0 like 0 dislike
Hidden content!
#include<stdio.h>
int gcd(int x,int y)
{
*** * **** ***** * * z;
* **** * *** ** ** * *** *
    {
** * *** * ***** ** *** **** ******* *** *
** *** *** ************ * ****** * ** *
*** *** ** * ** **** *** * *** * ** ******** * *** *** * **
** * **** * *** * * ** ** ** ** *** ** * ** *
** * * * * * * * *** * *** * ***** *** ** ** *** **
** ** * ******** * * ** * ** * **** ** **
* * **** **** ** * * * * * **** * * * y;
    }
* **** * **** * * * * *** * * ****
    {
* * *** * ** * * * *** * * *** *** ** * *** **
* * **** **** ** * * ** ** ** **** ** *
** ** * **** * * ** * **** ** ** * **** ** ** ****** * *** * **
* *** * * ** * * * ** * **** *** *** * ***** ******** * * *** *
* ** * * *** * *** *** ** ** ** ** ** ** *** ** ** *** ** **** ***
* **** ** **** ** *** * * ** * ** *** *** * * **
* * **** *** * * ** * ** *** **** ***** *** * * x;
    }
}
int main()
{
    int a,b,lcm;
** * * ** * * * * ** ** *** %d",&a,&b);
* **** * ** * ** *** *
* **** ** * *** ** *** * * *
* ** **** *** * ******** * ** * %d",gcd(a,b),lcm);
}
answered by (-255 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Correct output
0 like 0 dislike
Hidden content!
#include <stdio.h>
#include *** * *

int main()
{
* ** ** * * * a,b,i,j;
* * ** * ******* * * * ** * ** ********** *** *

* *** ** ** * * ** i>=1; i--)
**** ** **** ** * ***
** * ** ** ***** * * * * * * * * * * (a%i==0 && b%i==0)
***** ** ** ** ** ** * ** * * ** * ** *

* * ** *** ** * ** **
***** * * * * ** ** **** * *** * * *

*** * * ** ** * j<=a*b; j++)
* ** * *** ******* ****
** ** ***** ** * * ***** **** ** * * (j%a==0 && j%b==0)
**** ** *** * ** * ***** ** * * * * ** * * *** ** * *****
*** * ** * *** **
* * ** * * ** **** * * * ** %d",j);

** *** * ***** ** * ** ** ** 0;
}
answered by (-127 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Correct output
0 like 0 dislike
Hidden content!
#include<stdio.h>
int main(void)
{
** * ** * * * ** ** ** a,b;
* **** ***** * * * *** ** * %d",&a,&b);
* ** * * * *** * * i,gcd,lcm;
*** * * *** * * *** ** **** **** *
* * * * * *** * * * * *
*** * * **** ** * * ** * ** * *** ******** * * && b%i==0)
* ** *** ** * * *** *** **** ** * * ***
** * * * ** * * ******* *** * ** *** * * * * * * **
*** * *** * * * * * * * * ** * ** *
* ** * * **** *
** * * *** *** **
* * * * * **** * * ** * * * * * %d",gcd,lcm);
}
answered by (-249 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Case 4: Correct output
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.69.6.98
©2016-2024

Related questions

1 like 1 dislike
36 answers
[Exam] asked Nov 15, 2017 in Midterm by thopd (12.1k points)
ID: 32707 - Available when: 2017-11-15 14:10 - Due to: Unlimited
| 2.7k views
0 like 0 dislike
69 answers
[Exercise] Coding (C) - asked Oct 26, 2017 in Chapter 6: Loops by semicolon (5.2k points)
ID: 28913 - Available when: 2017-10-26 18:00 - Due to: Unlimited
| 5.1k views
0 like 0 dislike
21 answers
[Exam] asked Dec 9, 2017 in Midterm by thopd (12.1k points)
ID: 36754 - Available when: 2017-11-15 14:10 - Due to: Unlimited
| 2k views
0 like 0 dislike
22 answers
[Exam] asked Dec 9, 2017 in Midterm by thopd (12.1k points)
ID: 36753 - Available when: 2017-11-15 14:10 - Due to: Unlimited
| 2.1k views
12,783 questions
183,443 answers
172,219 comments
4,824 users