SDUT 1081 Above Average
2015-02-07 12:59
120 查看
题目描述
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 ornewlines, each giving the 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 b,n,i,j,temp,k;
float sum,q;
int a[1001];
scanf("%d",&b);
for(k=1;k<=b;k++)
{
sum=0;
q=0;
temp=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
q=sum/n;
for(i=1;i<=n;i++)
{
if(a[i]>q)
temp++;
}
printf("%.3f%c\n",(float)temp/(float)n*100,'%');
}
return 0;
}
相关文章推荐
- 1081Above Average
- SDUT 1479 数据结构实验之栈:行编辑器
- SDUT 2136 数据结构实验之二叉树的建立与遍历
- SDUT3324顺序表应用1:多余元素删除之移位算法
- SDUT3398数据结构实验之排序一:一趟快排
- hdu 1081 To The Max(暴力枚举+最大连续子数组和)
- SDUT 1252 进制转换
- SDUT 3377 数据结构实验之查找五:平方之哈希表
- 二叉排序树——SDUT
- SDUT2506完美网络
- bzoj1081[SCOI2005]超级格雷码
- HDU 1081 To The Max(dp最大子矩阵和)
- 第7届山东省赛sdut 3566---Triple Nim
- HDOJ 1081 POJ 1050 ZOJ 1074 TO THE MAX【dp】
- sdut 走迷宫
- sdut 双向队列(STL)
- [vijos1081]野生动物园(splay)
- SDUT Problem_5 二哥的狗(水题)
- acm sdut 数据结构实验之二叉树的建立与遍历
- sdut 2779 找朋友(dfs)