1 like 1 dislike
1k 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: 32707 - Available when: 2017-11-15 14:10 - Due to: Unlimited

edited by | 1k views

36 Answers

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

int main()
{
** * * * ***** **** * a,b,i,gcd,lcm;
* **** * * * * ** * *** * ** **** * *** * *** ** ** **
* * *** ****** * **** * ***
* ***** * *** ** ** ***
*** ****** ** ** *** ** ****   *** * ** *** ** ***
* * ** ** ** * * * ***   gcd=i;
* * *** *** **** * ****
** * * * ** * *** ** * * * * * ** *
* *** * * ** * ** *** *
** * **** * ** * * * %d",gcd,lcm);
* * * * ** ** 0;
}
answered by (-258 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,c,d;
* ** ***** **** * ****** * * %d",&a,&b);
* ** * ** * * * *** *** **
**** ** * ** ***** * ***
** *** ****** ****** * * * * && b>0){
** * * *** ** ****
* * * * * **** * ** * ** ** ** * ** ****
* ** **** **** ***** *** *
* * * *** ****** *** **
*** ** ** * *** * * * * ** ******* * * ****** **** = b%a;
**** * *** ** * ** ****
**** * * * * * ** *
* * ** * * * * * * ** ** * a == 0 ) {
****** ***** *** * * *** * ***** ** ** ** ** ****** %d",b,c*d/b);
*** ** * ** ******* * ***
* * * ** * ***** * * *** * * {
* * *** ** ** *** ** ** * * ** ** *** * %d",a,c*d/a);
* ****** * * ** *
}
answered by (-204 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!
* * * * *** * * *


main()
{
int * *** * *
* ** * *** * * ** *** ****
** * ** *** **
* * *
{
** ** ** * ** * *
* ** ** ** * * * * * *** *
* ** * * * * ****
}

k==a%b;
m==b%c;

for(k==0)
{
* ***** *** = ***** *
}
* ** *** ***
** ** * * *** * **
*** ***** *** **** * * *** *


return 0;
}
answered by (-32 points)
0 0
prog.c:4:1: warning: return type defaults to 'int' [-Wimplicit-int]
 main()
 ^~~~
prog.c: In function 'main':
prog.c:8:9: warning: format '%d' expects argument of type 'int *', but argument 2 has type 'int' [-Wformat=]
 scanf("%d %d",a,b);
         ^
prog.c:8:12: warning: format '%d' expects argument of type 'int *', but argument 3 has type 'int' [-Wformat=]
 scanf("%d %d",a,b);
            ^
prog.c:19:9: error: expected ';' before ')' token
 for(k==0)
         ^
prog.c:19:9: error: expected expression before ')' token
0 like 0 dislike
Hidden content!
#include<stdio.h>
int main(void)
{
** * * ** ****** *** * * * a,b,i,j,d,k,Z;
** ** ** * ** * * * * L1,L2;

*** ** * **** **** **** * * %d",&a,&b);


* ****** * ** * **** * * ** * * *** 28
    {
** ******* * * ** * * ******** * *** *** ** ** * * * * && b%i==0 )
******** *** * * *** * **** * * **
* ** * **** *** * * * ****** * * ** * * ** *** **** ** * ******* * * ** *
** **** ** * ****** * ** **** ** * *** *

    }
** * * * **** * ** * ** *** ***** *
** * ***** ***** * ** *** * *******
* ** * * * * * ** **
* * * * * *** *** ** ** ** ** * **** ****** ** * * *
***** ** * * * *** *** * ** *** * * ** * ** * *
* ** * ***** ** *** *
*** ** * * * *** * * *** ** (L1==L2)
***** * **** * **** *********** * ** * * *




*** ** ** * ** * * ** *** 0;
}
answered by (-249 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>

#include <stdlib.h>



int main()

{
* * *** **** *** * a,b,c,d,min,max,e,f;
* * * * * *** ** **** *** * * **** ** *** * *** *** * **
*** * * * * ** **** **** ** * ***** *

    {
*** ** *** ***** * * * *** ** ** * ** ** ** *** ** *** ** * * *** **
* * ***** ** ** * ** ** ***** ****** ***
* * * ** * ** ** * * * * ****** **** * **** * * * * * **
* ** **** * ** * ********** ** *** ** * * ** * *** * **** * ** ** * **
* ** * * ** ** ** * ***** * * ****

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

    {
** * * * * *** ** * *** ** ** ** * * * *
* * * ** * * ** * * ** * ****** *** ***** *

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

    {
** ** ** ** *** * * ** * * *** ***** * * ****
** *** * **** * * ******** ** * **** ** **
* * *** ** ** **** ** *** ****** * *** **** ** ** * ** ***
****** * * * **** ** ** ** * ** * * **** * * *** **
**** *** * ** * **** * *** * **** **** ***** * *

    }
**** ** ** * * ** **** * **** *** ** %d",min,max);
** * * * *** * ******* * * 0;

}
[] - answered by (-498 points)
ID: 33638 - Available when: Unlimited - Due to: Unlimited

edited by
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(void)
{
* * * * ** * * a,b,i,j,d,k;
** * *** ** ** * ** *** L1,L2;

* * * * * * * * ** ** * *** ******* %d",&a,&b);


* ***** ** * * * *** * * * *** ** * ** 28
    {
** *** *** * ** *** ** * ***** * * * * && b%i==0 )
* * *** * * * ** * ** ***** * *** ***** * **
******* **** * * * * *** * ** ******* * **** * * * * ** ** ** *
** * ** * ******* * *** ** * * ** ***** ** * *

** * * ** * ** * * * ***
* * * * ** * *** * ** ** * * *
* * * ** * * * ***** * ***** *** *
    {
* * **** ** ** * * * ** **** ** ** **** ***
* * *** * **** * * * ** * ** * ** *

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

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




* **** ** ***** * *** *** 0;
}
answered by (-249 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(void)
{
****** * ** * ** ** ** a,b,i,j,d,k;
* **** ** *** * ** * * ** * L1,L2;

*** * * *** **** * ** ** %d",&a,&b);


* * * * **** * * * * * **** *** ** ** 28
    {
** **** ******** * **** ** **** ** ** ** *** * && b%i==0 )
* ** ** * ** ** *** ** **** * * * * ***
** * * ** * * ** *** * * * * * ** ****** * *
*** ** *** ** * * ***** ****** * * * *** *

** *** * * * **** * *
* * **** ** *** ******* **** *** ** *** * *
** ****** * * ** ** * * ** ** *** * **
    {
**** *** * *** ** * * * * * ** * **
* * *** ** *** * * * *** ***** * ***

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

    }




** ** ****** **** * * 0;
}
answered by (-249 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!
* * * ** ** *
int main(void){
int *** ** *
* * ** ***** *** * ** **
* ** * * * **** * * * * *** * * * **
{
* ** ******* *** * ******** * * * * * *
* ****** *** * * * *
}
lcm=n1*n2/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 main()
{
    int a,b,c,d,e;
** ** ** * **** * *** * * %d",&a,&b);
**** * ** * ** *
* * * * * *** * *** *
** * *** * * * * * *** *
    {
** **** ** * *** * ** ** ** *** * * * *** ****
* * * * * ********** ** *** * * *
***** * * * ****** * * * ** * *** ** * *** *** * *
*** * ** *** * * ** * * * ***** **** ****** ****
* **** * **** * * * *** * ** ****** ** **** **** *
* ** ** ***** * * *** *** ** *** *** * ** * ***** **** %d",e,(a*b)/e);
* **** **** ** *** * * *** **** **
    }
** *** ** * * * * ** * * **
    {
* * * * * ** * **** * * ** ****** ** * * ** **** *
* ** *** ******* * ****** * ****** ** ** * **
** * ** ** **** ***** *** ** * * ** * *** *** * *
* *** ** * * **** ** ** * * ***** * **** * * * *** * **
* * * * * * ****** * * ***** * ** ***** ** *** * ***
* ** * * * *** * ** ** *** * * * * * * ** * %d",d,(a*b)/e);
** * * *** * *** * ** * ** ** *** *** * ** * * *
    }

}
answered by (-255 points)
0 0
Case 0: Correct output
Case 1: Wrong 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.70.178.116
©2016-2024

Related questions

0 like 0 dislike
10 answers
[Exam] asked Dec 9, 2017 in Midterm by thopd (12.1k points)
ID: 36752 - Available when: 2017-11-15 14:10 - Due to: Unlimited
| 483 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
| 1.9k 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
| 914 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
| 911 views
12,783 questions
183,443 answers
172,219 comments
4,824 users