0 like 0 dislike
6.9k views
請設計一個程式,讓使用者輸入三個整數數字,程式會輸出三個數當中最大的那個

 

範例輸入:

-10 5 99

範例輸出:

99
[Normal] Coding (C) - asked in 2016-1 程式設計(一)AC by (18k points)
ID: 13020 - Available when: Unlimited - Due to: Unlimited
| 6.9k views
0 0
Called for Help

39 Answers

0 like 0 dislike
Hidden content!
#include **** **** ** *

int main()

{
** *** **** ** * num1, num2 , num3, max;
* *** *** * *** * ** ** * ** * %d %d", * * ** *** * ***** **
* ** * * *** * *****
** ****** * * ** *** * = num1;
* **** ****** ** >= num2 && num1 >= num3)
* * ** * ** * *********
* ******* **** * ** * *** ** * ** * ** **** = num1;
** ** * *** * ** * *
*** * * * * ** * ** * > num1 && num2 > num3)
** * ** * * * * ** * **
** * * * **** * ** ** ******* * * * * * ** * = num2;
** * *** * ** * * * ** * *** *
*** ** ** *** > num1 * * * ** num3 > num2)
* * *** *** *** *
**** ** * ** *** **** *** * *** ** * * ** ** = num3;
**** * * ** * * *
**** ** * * * **** * ** * * * * ** ** ****** * *** * max);
* *** ** * * ** * **
** *** * * * *** *
** * *** **** ******* * * * 0;

}
answered by (-24 points)
0 like 0 dislike
Hidden content!
* ** * ** ****

int **

{
* ** *** * * int ** num2 , * max;
** * *** * * * * * * enter the ** * *
* * *** * * ** ** * ** **** * * ** ** *** *
* * ** *

* * ***** * max = **
** **** ** * * * * num2 *** * * num1 * * num3)
** *** * ** * {
* *** **** ** * *** * ***** max = num1;
* * * * }
*** * * ** ** ****** ** num1 **** **** num2 *** ****
** ** * ** {
* * * ** * * * *** max = num2;
* * * *** * *** * ** **** **

* *** **** ** *** ** ** num1 ***** *** ** num3 ***** num2)
*** *** {
*** ***** * ** * ** * max = ***
* * * ** **** }
* *** * * ** * *** * * **** * * is ** *
* * * **

* * * * * **

******* **** ** 0;

}
answered by (-24 points)
0 like 0 dislike
Hidden content!
* * ******* * ***
** *** * ** ***

int main()

{
* * * * ** int ***

scanf ** ** ** ** ** **
* ** * *** ***** ** ** ** **

scanf * * * ** * ****



d = a;

if * *** * ** *** d=b;

if ****** * * ***** * d=c;


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


* * *** * *** system * * ** * *
* * * *** return 0;
*** ***
answered by (-136 points)
0 like 0 dislike
Hidden content!
#include <stdio.h>

#include <stdlib.h>



int main()



{
* *** * *** *** ****** * a,b,c,i;
* * * * ** * *** * ** ** * * * * ** * ** * ***
* * * *** * * (a>b&&a>c)
*** ** * **** ** *** *** *** *** ** * * * * **
** ** **** ****** * ****** if **** * * * **** **** **
*** ** ** ** ** ** * ** * * * * *** * **
* * *** * ** * ** * * if * *** * *****
** ****** **** * * * ** ** * ** *** ** * * ** ** * * *
** ** ** ** ******* *** * *** * * *

}
answered by (-85 points)
0 like 0 dislike
Hidden content!
* *** * * **** *
* * * * * **** *



int main ()

{
*** ** ** * * * **** ** *** * i,num[3], max;


* * * * **** * * **** * = 0;i < 3; i++)
* ** * ***** * ** ** ******** **** * * **


* * ** * * * ** **** * = num[0];
* * * * ** *** * * ** * = 1;i < 3; i++)
* * * * ******** ** * ***** * ** * *** <num[i])
* *** ** ** *** * ** **** *** *** * * ** ***** * = num[i];


** * * ** *** * * * * max);


* * * * * ** 0;

}
answered by (-143 points)
0 like 0 dislike
Hidden content!
** ********
* * * * *



 main ()

{
*** * * * * * * ** i,num[3], max;


** ** ** * ***** ******** ** * = 0;i < 3; i++)
* **** * *** * * ** ** ** * ** ** ** *


** * * * ** * * ** * ** = num[0];
* * * * ** * * * ** * * * = 1;i < 3; i++)
* ** * *** * * ***** * ** *** *** ** *** *** * *** <num[i])
*** ** * **** ********* ***** * ** * * * ** ** ** ** = num[i];


* * * *** ** * *** *** *** max);


** * ** ** ** * **** 0;

}
answered by (-143 points)
0 like 0 dislike
Hidden content!
#include * * ** **
*** * *** * * ** *



int main()

{
* ** ** ** *** i;
* * * * ** * * * ** **


** ** * * * (i = 0;i < 3;i++)
** *** * *** *** * **** *** * *** ** * * * *** ***


** * ** ****** * * * (i = 1;i < 3;i++)
** ** ** * * ** * *** ** (num[0] < num[i])
** * *** * ** ** * ** ****** * * * ** * * *** ********* *** * ** *** = num[i];



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


*** *** ** * *** * * ** 0;

}
answered by (180 points)
0 like 0 dislike
Hidden content!
#include<stdio.h>



int main()

{
* *** *** ** ********* num[3];
* *** ** * * ** ** *** **** i;
* ** ** ** * * * * max;
** **** *** **** **
* * * ** **** * * * * (i=0;i<3;i++)
* ** *** **** * * ** * * ** * ** *** ** *
* *** * * * * **
**** ******* *** ** *** * *
* * *** * ** ** ** ** ** (i=1;i<3;i++)
*** *** *** * * *** *
*** * * * * * * *** * * * * ** ** ** ** * max < num[i] )
*** ** **** * * *** ***** * * = num[i];
*** ** ** ** * ** *
*** * **** * ** ******* * ** **** **** * * ****

 }
answered by (-124 points)
0 like 0 dislike
Hidden content!
* ** ** *** * **
* *** * * ****

int main()

{

 int i,num[3]={0};
* ** * **** * * **
** *** * ** * ** ** ** *

for(i=0;i<3;i++)


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


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


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


**** * * ****** * * ** * * ",num[0]);

 return 0;

}
answered by (-248 points)
0 like 0 dislike
Hidden content!
*** * ** * *** * *
* *** * ** * *

int main()

{

 int i,num[3]={0};
** ** * ** *
*** * ** ***** * * ***

for(i=0;i<3;i++)


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


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


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


* * * * ** ** * ** ** * *** *** ** ",num[0]);

 return 0;

}
answered by (-248 points)
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:104.23.197.94
©2016-2026

Related questions

0 like 0 dislike
35 answers
[Normal] Coding (C) - asked Oct 13, 2016 in 2016-1 程式設計(一)AC by Shun-Po (18k points)
ID: 13422 - Available when: Unlimited - Due to: Unlimited
| 5.8k views
0 like 0 dislike
43 answers
[Normal] Coding (C) - asked Oct 11, 2016 in 2016-1 程式設計(一)AC by Shun-Po (18k points)
ID: 13025 - Available when: Unlimited - Due to: Unlimited
| 7.3k views
0 like 0 dislike
49 answers
[Normal] Coding (C) - asked Oct 11, 2016 in 2016-1 程式設計(一)AC by Shun-Po (18k points)
ID: 13023 - Available when: Unlimited - Due to: Unlimited
| 8.4k views
0 like 0 dislike
0 answers
[Resource] asked Dec 31, 2016 in 2016-1 程式設計(一)AC by laich (937 points)
ID: 20298 - Available when: Unlimited - Due to: Unlimited
| 38 views
12,783 questions
183,442 answers
172,219 comments
4,824 users