0 like 0 dislike
5.7k 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: 14581 - Available when: Unlimited - Due to: Unlimited
| 5.7k views
0 0
Called for Help

37 Answers

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

#include ** * ** * **



int main()

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

} ** ** *** * **** * ***
** **** ** ** * * 0;

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



int main()

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



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

int main()

{

int * ** **
****** * *** * * *
** *** *** ** * *
***** **** ***

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



return 0;



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

int main()

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

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

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


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





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

#include ***** * * *



int main()

{
*** *** *** * * * *** ** i, tmp;
*** * * * * * **** * num[10] = {0};
*** *** * * ** ** * * (i = 0; i < 10; i++)
** * ******** ** ** *** *** ** * **** * * ** *** ** &num[i]);
** * ******** * ** * ** * (i = 9; i >= 0; i--)
* ** * * * * * * *
* * *** ** ** * ** * * * * **** * * (num[0] >= num[i])
* * * * **** ** *** * **** * *** * *** * **
**** ** * *** * *********** * ** * * ****** * * * * * ** ** = num[i];
***** * *** * * * *** ******** * ** ** **** ***** ****** * * * ** = num[0];
*** ***** * ** *** *** ** * *** * *** *** * * ** * ** * * * * * = tmp;
******* * ** ***** * * * ** * * * *
* * *** * * *** * **
* ** * *** ** * ** *** * ", num[0]);
* ** ** * * ** ****** * 0;

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

int main()

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

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

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

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


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





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

int main()

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

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

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

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


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





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

int main()

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

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

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

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


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





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

#include<stdlib.h>



int main()



{   

    int x[10],i,j,t;

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

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

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

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

    

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

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

    }

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

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

    

    return 0;

    

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

#include <stdlib.h>

int main()

{
**** ** * * num[10]={0};
* * *** ** ** * *** * i;
** * **** * * * * * * min;
** *** * * **** * i<10; i++)
* ****
* *** ** * * * * * * *** ** *** * ***** &num[i]);
* ** * ** **** *
**** ** * ** ** * i<10; i++)
** *** * * *** * **
* * * * ** ** * * ******** ** * = num[0];
* * *** **** * **** * * * ***** ** > num[i])
*** * * * * ** * ** * ******* **
* * ** * * * * ** ** ** ** *** *** * **** ** ** = num[i];
** * *** *** *** * * * * *** **
* * **** * * * *
* * * ** * ** ***** * *** *** **** ** *
* * ** * *** ** *** * * **
** * *** ** * ** ** * * * 0;

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

Related questions

0 like 0 dislike
54 answers
[Exercise] Coding (C) - asked Oct 20, 2016 in 作業 by Shun-Po (18k points)
ID: 14583 - Available when: Unlimited - Due to: Unlimited
| 7k views
0 like 0 dislike
31 answers
[Exercise] Coding (C) - asked Oct 20, 2016 in 作業 by Shun-Po (18k points)
ID: 14582 - Available when: Unlimited - Due to: Unlimited
| 4.5k views
0 like 0 dislike
37 answers
[Exercise] Coding (C) - asked Oct 20, 2016 in 作業 by Shun-Po (18k points)
ID: 14579 - Available when: Unlimited - Due to: Unlimited
| 5.1k views
0 like 0 dislike
45 answers
[Exercise] Coding (C) - asked Oct 13, 2016 in 作業 by Shun-Po (18k points)
ID: 13501 - Available when: Unlimited - Due to: Unlimited
| 6.3k views
0 like 0 dislike
40 answers
[Exercise] Coding (C) - asked Sep 29, 2016 in 作業 by Shun-Po (18k points)
ID: 11795 - Available when: Unlimited - Due to: Unlimited
| 5.7k views
12,783 questions
183,442 answers
172,219 comments
4,824 users