0 like 0 dislike
6.8k views
請設計一程式,由使用者輸入N個數字,求這些數字的平均。使用者輸入的第一個數字N代表接下來會有多少個數字要求平均,接下來的N個數字就是需要計算平均的數。輸出請輸出到小數點後6位。

sample input:

10 1 2 3 4 5 6 7 8 9 10

sample output:

5.500000
[Exercise] Coding (C) - asked in 2016-1 程式設計(一)AD by (18k points)
ID: 15385 - Available when: 2016-10-27 18:30:00 - Due to: 2016-10-27 21:00:00

edited by | 6.8k views
0 0
Called for Help

121 Answers

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



int main()

{
* ******** * *** A,B;
* * ** ** ** * *** * * D[A];
* *** **** * ** ***** * * C;
* * * * * * *** * ** **** ** *** * * ** ***** *
*** ** * * * ** * * * * * ** **
** *** * **** * ***** * * *** *** * ** ** *
* * * * *** * * * ** * *
* ** * *** * ** ** * * ** * ***

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



int main()

{
* * *** * ** ** *** * A,B;
* ** * **** ** ** * * * * * D[A];
* ** ***** * * C;
* * * * * *** * ** * * * * ** ** ** ** ** *
** ** * * *** * * *** ** * * ** ***
*** ** *** ******* ** ** *** * * ** * * * ** ** **
* * * * *** * ***** ** *
* * *** ******** * * * * * * *** * * *** *

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

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



int main()

{
**** * * ** ** ** * n, i;
*** *** ** ** ** ** * **** sum, avg;
** **** ** * *** **** * * ** ** &n);
* ** * * *** * ** *** num[n];
* *** **** * (i = 0; i < n; i++)
* **** *** ** * ***** * * * * **** * ** * *** ** ****** *** &num[i]);
*** * * *** ** * ** (i = 0; i < n; i++)
* *** ** **** ** * * **
** * ** * ** * ** *** * **** * **** += num[i];
**** * * ***** **
* ***** ** ****** ** = sum / n;
* ** * * ***** *** *** * **** avg);


** * * * * * * 0;

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



int main()

{
*** * ** * * * * ** * * * i,j,k,l;
** ** ** ** ****** **** *
** ** *** ** ** *** * * ** **** *** * *****
*** * ** * ******* * * = i ;
*** * ** * * ** ***
* * ** * *** ** * ** n[j];
* * ** * * * * *** ***** ** = 0;k < i;k++)
*** *** * * * * * ** *** * ** * *** n[k]);
* ** * *** * * *
* *** * * **** ***** **
** * ****** * * ****** * = 0;
** * * * * ****
** *** ****** **** * = 0;k < i;k++)
* ** * * **** **** ** * * = l + n[k];
** ** * * ** **

   

   
** * ** ******* * ** ***** * **** / i);
* *** * * *** **** * ****
* ** * * * * * **** **** * ****** * *
* * ** ** * * *** * **** * 0;

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



int main()

{
*** * ******** * ** ** * i,j,k,l,m;
*** * * * ** * * **
** *** * * * * * * * ** ** *** * * * *** * *
* ** * ******* = i ;
** ********* *** * * ***
* * * * ** * * * *** * n[j];
* **** * ** * ** *** * = 0;k < i;k++)
* ******* * * * * * ** ** * * * *** n[k]);
***** *** * * * * ******
* ** * * ** * * ***
* * * * ** ***** **** = 0;
** ** * *** ***** **
**** * * * * ** * *** * = 0;k < i;k++)
* * ******* ********* ** ** = l + n[k];
** ******

   

   
** *** * *** ** * ** ***** ** **** / i);
* * *** * **
* * * * *** * *** * * * ***
**** ****** ******* * * 0;

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

#include *** * ***



int main()

{
** * ** * *** * * n, i;
* * ****** * * * * sum, avg;
*** * ******* ** * ** * ** * * ** *** &n);
* * * ** * * ** * * num[n];
** * *** * * * ** *** (i = 0; i < n; i++)
** * * * *** * * ** * ** ***** * * *** * * * ** * * ** &num[i]);
* *** * * * * * *** (i = 0; i < n; i++)
** *** * *** *
*** ** * ** * * ** ** *** ** ***** ** **** += num[i];
** ** *** ****
***** * *** *** = sum / n;
***** * *** *** ** * *** ***** **** ** * ** * avg);


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

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

#include <stdlib.h>



int main (void)

{
* * * * ** * **** * counter=1,
** ** *** **** * *** ********* * ** * ** * * * *
** * * * * * ** * * ** *** * * * * **
** ** * * ** * *** * j=0;
*** ** ** **** * ** * *
******* ** ** * ** * * **** * * *

    
** ** * ** * * * * * **** {
* * ***** ** ** * * ******* ** * * ** ** * * *
** *** * *** * * = j+i;
** ** * **** **** **
** * * ** ** *** **

    
**** * * *** * * = j/n;
** * * *** ** *
* * ** * * ** * *** * * ** **** * *
* * ** **** ** *
*** * * * *** ** *** ** * ***** * * *
** *** **** ** * ** * ** 0;

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

#include * ** *



int main()

{
* * ** * * ** * ** * n, i;
* * * * * ** ** ** sum, avg;
**** * **** * * ** * **** * ** ** * &n);
* * ** ** * * * *** ** num[n];
* * ** *** * * * ** * (i = 0; i < n; i++)
*** * * ** *** ****** **** * * *** * * *** ** * **** * ** ** * * * ***
** * * * * * * * ** (i = 0; i < n; i++)
* * ** ** * * *******
*** ** * * * ** ** * * *** ***** ***** ** ** * += num[i];
** ** * * *** * ***** *** *
* ** * * * * ******* * ****** * = sum / n;
** *** * ** ** * * *** * ", avg);


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

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

#include **** * *



int main()

{
***** * * ** ** n, i;
* * ** * * ** ** * ** sum, avg;
** * * ** * ** ** *** ** * * * ***** * ** &n);
* * ** * *** * * ** * num[n];
** * *** ** * *** * ** ** (i = 0; i < n; i++)
* * ** *** * * ** ** ***** * ****** *** * * *** ** &num[i]);
** * * ** (i = 0; i < n; i++)
* ** * *** ** ** *** *
* ** **** *** ** ** *** * * * * ***** * ** += num[i];
** ** * **** * * *
**** * * ** *** **** * = sum / n;
* ** * *** **** *** ** * ****** ** *** avg);


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

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

#include * * ** *



int main()

{
* * **** * * *** * ** ** n, i;
*** * * ** ** ***** * * * * sum, avg;
** * *** ****** * * * * ** * * *** ** &n);
** * * *** **** *** ** **** num[n];
** **** * * * ****** (i = 0; i < n; i++)
***** * * * *** ***** * ***** *** ** ***** ** * &num[i]);
*** ** * **** ** **** (i = 0; i < n; i++)
* * ** * * ** * * *
* *** * ** * * ** * * *** ** * * ** ** ** * += num[i];
** * **** * ******* * * * *
* * *** **** * ** ** * ** = sum / n;
* * ** * *** * **** *** * ***** * * * avg);


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

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

Related questions

0 like 0 dislike
5 answers
[Exercise] Coding (C) - asked Oct 27, 2016 in 2016-1 程式設計(一)AD by Shun-Po (18k points)
ID: 15448 - Available when: 2016-10-27 18:30:00 - Due to: 2016-10-27 21:00:00
| 699 views
0 like 0 dislike
33 answers
[Exercise] Coding (C) - asked Oct 27, 2016 in 2016-1 程式設計(一)AD by Shun-Po (18k points)
ID: 15445 - Available when: 2016-10-27 18:30:00 - Due to: 2016-10-27 21:00:00
| 2.6k views
0 like 0 dislike
11 answers
[Exercise] Coding (C) - asked Oct 27, 2016 in 2016-1 程式設計(一)AD by Shun-Po (18k points)
ID: 15441 - Available when: 2016-10-27 18:30:00 - Due to: 2016-10-27 21:00:00
| 1.3k views
0 like 0 dislike
73 answers
[Exercise] Coding (C) - asked Oct 27, 2016 in 2016-1 程式設計(一)AD by Shun-Po (18k points)
ID: 15439 - Available when: 2016-10-27 18:30:00 - Due to: 2016-10-27 21:00:00
| 4.5k views
0 like 0 dislike
41 answers
[Exercise] Coding (C) - asked Oct 27, 2016 in 2016-1 程式設計(一)AD by Shun-Po (18k points)
ID: 15427 - Available when: 2016-10-27 18:30:00 - Due to: 2016-10-27 21:00:00
| 3.1k views
12,783 questions
183,442 answers
172,219 comments
4,824 users