zoj1915--------------------Above Average
2012-08-18 15:47
162 查看
It is said that 90% of frosh expect to be above average in their class. You are to provide a reality check.
Input
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 giving the final grade (an integer between 0 and 100) of a student in the class.
Output
For each case you are to output a line giving the percentage of students whose grade is above average, rounded to 3 decimal places.
Sample Input
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
Sample Output
40.000%
57.143%
33.333%
66.667%
55.556%
代码:
Input
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 giving the final grade (an integer between 0 and 100) of a student in the class.
Output
For each case you are to output a line giving the percentage of students whose grade is above average, rounded to 3 decimal places.
Sample Input
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
Sample Output
40.000%
57.143%
33.333%
66.667%
55.556%
代码:
#include <iostream> #include <cstdio> using namespace std; int main() { int T; cin>>T; while(T--) { int n; cin>>n; int grade ; double ver=0; double per; int count=0; for(int i=0; i<n; i++) { cin>>grade[i]; ver=ver+grade[i]; } ver=ver/n; for(int i=0; i<n;i++) { if(grade[i]>ver) count++; } per=double(count)/n*100; printf("%.3lf",per); cout<<"%"<<endl; } return 0; }
相关文章推荐
- zoj 1915 Above Average
- zoj 1915 Above Average
- zoj 1915 Above Average
- ZOJ Problem Set–1915 Above Average
- ZOJ 1915 Above Average
- zoj 1915 Above Average(水~)
- ZOJ-1915
- 1915_Above Average(百分数的输出)
- zoj 1915
- ZOJ 1915
- zoj 1382 A Simple Task
- zoj 1047 (bfs)
- ZOJ2321解题报告
- zoj 1002
- zoj 1715 When Can We Meet?
- 博弈---ZOJ 3057 Beans Game(DP博弈)
- ZOJ 3875 Domination (概率DP)
- ZOJ 3792 Romantic Value(最小割,最大流)
- zoj 2345 Gold Coins
- ZOJ 3755 Mines 回溯+剪枝