1081Above Average
2013-12-09 22:47
197 查看
题目描述
It is said that 90% of frosh expect to be above average in their class. You are to provide a reality check.输入
The first line of standard input contains an integer C, the number of test cases. C data sets follow. Each data set begins with an integer, N, the number of people in the class (1 <= N <= 1000). N integers follow, separated by spaces or newlines, each givingthe final grade (an integer between 0 and 100) of a student in the class.输出
For each case you are to output a line giving the percentage of students whose grade is above average, rounded to 3 decimal places.示例输入
5 5 50 50 70 80 100 7 100 95 90 80 70 60 50 3 70 90 80 3 70 90 81 9 100 99 98 97 96 95 94 93 91
示例输出
40.000% 57.143% 33.333% 66.667% 55.556%
#include<stdio.h> int main() { int m,n,a[1000],i,j,k,s; double b,d,c; scanf("%d",&m); for(i=1;i<=m;i++) { scanf("%d",&n);s=0; for(j=1;j<=n;j++) { scanf("%d",&a[j]); s=s+a[j]; } b=s/n;c=0; for(j=1;j<=n;j++) { if(a[j]>b) c=c+1; } d=c/n*100; printf("%.3lf%%\n",d); } return 0; }
相关文章推荐
- SDUT 1081 Above Average
- FOJ--1629--Above Average--解题报告
- hdu 1081 To The Max最大连续子串和
- ural 1081 Binary Lexicographic Sequence
- hdu 1081 To The Max
- hdu 1081 To The Max
- hdu 1081 (最大子段和的升级版,二维)
- hdu 1081 To The Max
- hdu 1081 To The Max
- dlutoj 1081 巧斗雷震子
- HDU 1081(最大子矩阵问题)
- ZJU-PAT 1081. Rational Sum (20)
- hdu 1081最大子矩阵的和DP
- PAT 1081. Rational Sum(20)
- zzuoj1081 三进制小数
- [hihoCoder] #1081 : 最短路径·一
- HDU 1081 To The Max--DP--(最大子矩阵)
- ZOJ 1081 Points Within
- poj2350 Above Average(模拟)