0 like 0 dislike
11.1k views
請設計一程式,讓適用者輸入十個正整數,程式會找到其中最小的數然後輸出。

 

Sample input:

1 2 3 4 5 6 7 8 9 10

Sample output:

1
[Exercise] Coding (C) - asked in 作業 by (18k points)
ID: 14272 - Available when: Unlimited - Due to: Unlimited
| 11.1k views

65 Answers

0 like 0 dislike
Hidden content!
* * ** * **** ***

int main()

{
* ** *** * * ** * *** i , *** * ***


* ** * *** * ** * = 0;i * * * 10; i++)
** * * * **** * * ** * * * * ******* * *


* * *** * ** * **** * = 1;i ** 10; i++)
* * * * ** **** ** *** *** ** * * > num[i])
* ***** * ******* * * * * ** * = num[i];




* *** * **** *** *** * * * num[0]);


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



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



int main()



{



int * ****


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



for * ** **

if ** ** *
* * ***** ****** *** *** * *


* * ****** ***


** 0;









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



int main()

{


** **** *** ** ** * * * ** i, ** min;
** * * ** * *** *** ** *** (i=0; i<10 ; i++)
* * * ** * * * ** * * * **** * ** * ** * ****




**** * * ** * *** * * **** num[0];
** ***** *** * (i= 1; i < 10 ; i++)
** * ** * * *** * * **** (min > num[i])
* ******** * ***** * ** * * * * * ****** ** * ** * ******


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













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

#include <stdlib.h>



int main ()

{
* * ** * ******** i , k[10], m;


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

    {
* * * * ** *** * * ** * ** * * *** *** * *** * ** &k[i]);
* ***** * * ** * * * *
*** * * ** * *
*** * * * ** ******* * * * * ** * *
* ** ** * * ******* ** *
* ** * ** ******* *** ** ***** *** ** * *** ********
** * ** ** * * * *** * * * * * *
** **** **** ******* ** **** *** *** *** ** * ** ****** * * * *
* *** ** * * * * ** ***** ** * * **
**** ** * ** * * *** **


* ** * * * * ** * * ***** * *** *** * m);
* * ** * * ** * * *** 0;

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

int **



{
* * ****** * * * ** * b = 0, min = 0;


* ** * *** ** ** = 0;b * * 10;b ++)
** * ** ** * ***** ** ** * * ** * **


** ** **** **** ****** =
* *** ** ** ** ** ** = 0;b **** 10;b ++)
** * *** *** * ****
* * * ** * * * * *** ***** *** = **** ** min)? a[b] : min;
****** * ** * ** *


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


** * 0;

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



int main()

{

    int num[10];
** * ** ** * * * * ** i,j,k;


* *** * *** * * * *** * i<10; i++)
** * * **** * * * * ** * ** ** ***
* * * * * * * * *** * **** **** * * *** *** ** ** * * * ** ***
******** * * * **** * * ** * * *** ***
* * * ****** * **** **
*** *** * ** * * **** * ** i<10; i++)
** * *** * * * * * * ** ** * ***** **
* ***** * ** *** *** ** * ***** *** * ** ( k > num[i])
** * * * ** ********* * *** ** ** ***** * *** * * * * *** ** * ***** * **
* * * **** * ***** * *** ** *** * *
*** ** **** **** * ** ******* * * ***** **





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


* *** * * main()

{
* * ** i, * * *


* **** ** = 0; i ** * 10; i++)
* **** * **** * * * ** ** * * * ** ** * * ** * ****




* * ** * = num[0];
*** **** = 0; i * 10; i++)
*** *** * ***** ** ** ** < min)
**** * * * ** ** * *** = num[i];
* ** * * * ** * ***** * * ** * * ** **


*** *** 0;

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

#include <stdlib.h>



int main ()

{
** ** *** ** *** ** i , k[10], m;


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

    {
* * ** ** * *** ** ** * **** * * * ***** &k[i]);
** **** ** * ** ** *
* * *** ** ** * ******
** *** **** ***** * ***** * * ** *
* *** *** ** *
***** * * *** ***** * * * **** *** ** *** * **** **
** ** * *** **** ** * * ** * ** * * * ****
* * *** ** *** * * * ** ** **** * *** ****** * * * *
* * ***** ** *** * **** **** ** * *** **
* * * * *** * * **


*** * ***** * ** * **** * * * m);
*** *** ** * *** ** * * * 0;

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

#include * * * * *



int main()

{
* * ** * * **** * i,num[10] = {0};
*** *** * *
** ** * * *** * * * (i = 0;i , 10; i++)
*** ** * **** * * ** * * ** * * *** * *** ***
* ** **** * * *** ** * * *** *******
** *** * (i = 1; i <10; i++)
** ** ** ** * ** ***** ** ** ** * (num[0] > num[i])

****** ** * * ** * *** * ** * * ** ********** * = num[i];
** * ** * * * * * * ** * ** * ** ** * *
* * ** ****** * ** ** * * * **** num[0]);
** * ** * * **
* *** ** ** * * * 0;

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

#include ** * * *****



int main()

{
***** ** ******* * * i,num[10] = {0};
* * ** ** * ** ** **
** * ** ** ***** ** (i = 0;i , 10; i++)
* * * * * ** * ** ************** ** * ** ** * ** ** * **** *
* * * *** **** * * * ***** * * * **
* * ** * ** * * * * (i = 1; i <10; i++)
* ** ** ** * * * * * ** ********* (num[0] > num[i])

* *** * * * ** ** * ******* * **** * *** ** ** ** = num[i];
** ** *** * ** * *** * * *** * * ***** *** ***
* * * * ** ** ** * *** ** num[0]);
*** * *** * **
*** *** * *** **** * *

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

Related questions

0 like 0 dislike
69 answers
[Exercise] Coding (C) - asked Oct 19, 2016 in 作業 by Shun-Po (18k points)
ID: 14288 - Available when: Unlimited - Due to: Unlimited
| 11.1k views
0 like 0 dislike
76 answers
[Exercise] Coding (C) - asked Oct 19, 2016 in 作業 by Shun-Po (18k points)
ID: 14120 - Available when: Unlimited - Due to: Unlimited
| 12.4k views
1 like 0 dislike
129 answers
[Exercise] Coding (C) - asked Oct 19, 2016 in 作業 by Shun-Po (18k points)
ID: 14119 - Available when: Unlimited - Due to: Unlimited
| 18k views
0 like 0 dislike
61 answers
[Exercise] Coding (C) - asked Oct 13, 2016 in 作業 by Shun-Po (18k points)
ID: 13736 - Available when: Unlimited - Due to: Unlimited
| 9.8k views
0 like 0 dislike
152 answers
[Exercise] Coding (C) - asked Oct 5, 2016 in 作業 by Shun-Po (18k points)
ID: 12295 - Available when: Unlimited - Due to: Unlimited
| 19.4k views
12,783 questions
183,442 answers
172,219 comments
4,824 users