0 like 0 dislike
8k 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
| 8k views

65 Answers

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



int main()

{
* ** **** * * * ** * i ;
* * ** *** *** * ***** * stu[10];
* * ** *** ** * * *** ** * min ;


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


****** * ** *** ** ** * = stu[0];
**** ** * * **** * ** ** = 1; i < 9 ; i++)
*** ** ** *** * ** * * * ****** * ** ** ** ** > stu[i])
*** * *** ** * ** ** * * **** ** * ** ** * * ****** ** * * = stu[i];


** * * * ***** * * * ****** * ** ** * min);

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



int main()

{
* ** * * **** * number[10];
** * ********* ******** * * i,min;


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


* * * ** ** * = number[0];
* ** ** * * ** * ***** ** ** ****
* * * * * ** ** ** * ** * * (min > number[i])


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


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

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

int main()

{
** * ** * * *** * i,num[10]={0};


* ** ****** ** * ** * *
* * * ** * ** * ** * ** ** ** * , &num[i]);


* ** * *** *** * * *** * ***
** * * * ** ** ***** * ** ** ** *
* * * *** * * * ** * ** * *** * * ** = num[i];


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


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

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



int main()

{
* ** **** * * ** ** i, * * min;


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


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



return 0;

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


* ** main()

{
* * * i, ***


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




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


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


* *** * 0;

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

#include ****** ** ** ** * * *





int main()

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


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


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



int main ()

{
** * **** * ** i = 0  , student[10] ;
** *** * ** * ** * **** ** ** ** * * = 0 ; i < 10 ; i++)
*** * ** * * ** * **** ** * * * * * *** *** ** *** , *** ** ** ***
** * ** * * *** ** **** ** = 0 ; i < 10 ; i++)
* * * *** *** ** * ** ** ** * * * ** * * *** * ** ** ** ****** ** **** ** *** **** * > student[i])
* **** ***** * * * * * * * **** ** ** * * ** * * * ** ** * * ** * *** * * **** *** * = student[i];
* ** ** * * ** * * * *** ** *** * * * student[0]) ;












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

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



int main()



{

int i ,num[10]={0},min;

for(i=0;i<10;i++)
** * *** ** * * * ** * ****** *** **** ** * * * * ***
**** * * * * ** ** ** ** * **
* ** ** * *
* * * * ***** ** * * * * ** ***
* * * * * *** * * ******
*** * *** ** *** * ** ******** *** ** ** *



return 0;



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



int main()

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


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


* ** * *** * ** * *
** ** ** *** ***** ***** *
* * *** * *** * *** (m>n[i])
******* *** **** * ******** * * * **** * * ***


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


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



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



int main()

{

int i,num[10]={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:172.69.214.205
©2016-2025

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
| 8.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
| 9k 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
| 13.3k 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
| 7.3k 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
| 14.7k views
12,783 questions
183,442 answers
172,219 comments
4,824 users