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

65 Answers

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

int main()

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

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

   j = k[0];
* * ** * ** ** * * ( i = 1 ; i < 10 ; i++)
* * **** ** * * * * * *
* * **** * * ** ** ****** ** * * ** ** ** * * (j < k[i])
** **** ***** **** *** **** *** * *** ** ** *
* * * ** * * * * * * ** *** ** *** * ******* * ** ** = j;
*** * * * ** ** ** ** * * ******** *** * * * * ***** *
* * **** * ** * * ** ** **** * *** *
** * * * * * **** * ****** * ** * * * * * * * ***** * *** = k[i];
* * *********** ** ** * ** * ** *
* * * ** * * * * *** ** ** *** * ** ** *
* ** * * ** * **** * ** ** ** * *** 0;

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



int main()

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

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



int main()

{
* * ** * * * * ** *** ** i = 0;
* ** * ** ******* * * aa[10];


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


** * ** ******* * * * *** ** ** aa[0]);











return 0;

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

int main()

{
* * * i, *** * ;
* mini;


**** ** * * i++)
* ***** ** ****** *** ** ** ** * *


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


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






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





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

#include<stdlib.h>

int main()

{

int i = 9,a[i],m,n;
* ** *** * ** * *** * * * * **
** ** * * * * * *** * ** * ** * * * ** * * * ** ** *** ** *** ** *
** ****** ***** * * * **
***** ** *** ** * *** * * * **
** ***** * **** **
* * **** ** * * ** * ** ** *** ** ***** * * <= n)
* ** ** * * * * ** *** * * * * *** * *** * * *** ** * **** * ** * ** *** ** = a[m];
** ** *** * *** * * ** * * * ******* * * > n)
* * * *** *** * * * ** * * *** ** * *** * *** * ***** = n;
** **** *** **** * *
*** ** * *** * * * *** * ** * ** ****** * * * ** * *

  return 0 ;

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

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



int main()

{


**** * ***** * ** ** *** i;
** * **** ** * * ** r[10];


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


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


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

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



int main()

{


** * * ** i, num[10];
** ** ***** min ;








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


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


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

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



int main()

{
**** * * ********* *** ****** * m,k=999;




* **** **** **** * ****** student[10];
* ** *** * * * * ** * * ** * *

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

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



 return 0;

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



int main()

{
** * * * * *** ** i = 0, a = 0;
******* **** *** * * aa[10];


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


* * ****** * ***** * * * **** * **** a);











return 0;

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



int main()

{


*** * **** i, num[10];
* ** *** ** min ;








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


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


*** * ** *** * **** **
answered by (-120 points)
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.69.17.62
©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
| 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
| 4.5k 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
| 6.6k 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
| 3.9k 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
| 7.6k views
12,783 questions
183,443 answers
172,219 comments
4,824 users