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

65 Answers

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

#include<stdlib.h>



int main()

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


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

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



int main()

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

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

#include<stdlib.h>



int main()

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


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

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

#include * ** * * * **



int main()

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


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


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



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

int main()

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


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


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


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


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



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



int main()

{
* * ******* * * * a[10] ={0},b ,c ;


* * *** ** * * ** * <10;b++)
******* * * * ** * * **** ** * * * **


* *** *** *** * * *
* * * **** * *** * * <10;b++)
* * * * ***** * * ** *** * > a[b])
* * ** *** ** * * ** * * *


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


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

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

int main(void)

{
* *** * ** *** ** i;
* * * ******* stu[10];
* * ****** *** = 0;i < 10;i++)
** * * * * *** * ** * * *** * * ** *** **
*** ** **** * ** = 1;i < 10;i++)


** * * * * * *** * *** ** ** ** * > stu[i])
* ******* * * * ** * ** *** ** * = stu[i];
* * * **** * ** **** *** * ** * * *** * * * * ******
** * * * ** * ***** * ** * * ** * ** * 0;











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

#include * * * * ***



int main ()

{
* * ** ** * ***** i , k[10]={0}, m;
** * * * ** * * ** **** %d %d %d %d %d %d %d %d %d", &k[0], ******* &k[2], &k[3], ** ** &k[5], * * * &k[7], &k[8], *****
* * ** ** * * ********
*** * *** **** **** ** * * *** * ****
* ****** ** *** *** *
* *** * ** ** ***** *** * * **** ** * *
*** * ** * ** *** * * ** ** ***
* ** ** ** * * ** * ** ** ***** ** ** * * * **
** * * * *** * ** ****** ** * * ** ***
* * ** * * ***** * **


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

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

#include * ** * * *



int main()

{
**** * ** ********* * *** i;
** * * * **** ** * ** r[10]={0};


* * ** ** * * ** * * * = 0; i < 10; i++)
** ** * * * * * ****** * * * * ** ** * * * * * &r[i]);


* *** * ** *** * ** ** = 1; i < 10; i++)
* *** ** **** *** * * * * ** * *** ****** *** * **** > r[i])
** ** *** * * * *** ** ** * ** *** ** *** = r[i];
* ** * *** * ***** ** * ** *** **** *
* **** ** ** ** ** ** ** * * * * r[0]);


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

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



int main()

{
* *** * * *** * i ;
* * * **** ***** * * *** stu[10]={0};
****** * **** ****** ** min ;


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


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


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

}
answered by (-90 points)
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.69.17.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
| 7.4k 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
| 8.2k 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
| 12.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
| 6.7k 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
| 13.7k views
12,783 questions
183,442 answers
172,219 comments
4,824 users