zoj 1915 Above Average
2012-03-31 12:34
387 查看
#include "iostream" #include "algorithm" #include "memory.h" #include "iomanip" using namespace std; int main() { int num[1010]; int testcase, n, i, sum, average, count; double ans; cin >> testcase; while (testcase--) { cin >> n; memset(num, 0, sizeof(num)); sum = average = count = 0; for (i = 0; i < n; i++) cin >> num[i]; for (i = 0; i < n; i++) sum += num[i]; average = sum / n; for (i = 0; i < n; i++) if (average < num[i]) count++; ans = count * (1.0) / n * (1.0); cout.setf(ios::fixed); cout << setprecision(3) << ans * 100 << "%" << endl; } }
相关文章推荐
- zoj 1915 Above Average
- ZOJ Problem Set–1915 Above Average
- ZOJ 1915 Above Average
- zoj 1915 Above Average(水~)
- zoj 1915 Above Average
- zoj1915--------------------Above Average
- ZOJ-1915
- 1915_Above Average(百分数的输出)
- zoj 1915
- ZOJ 1915
- WA:ZOJ 1025 Wooden Sticks
- ZOJ 1074 To the Max
- ZOJ 3471 Most Powerful(状压DP)
- ZOJ - 3537 Cake (凸包+区间DP+最优三角剖分)
- ZOJ 1082 简单图论Floyd算法
- OpenJudge/Poj 1915 Knight Moves
- ZOJ 3323Somali Pirates
- ZOJ 3963 Heap Partition( 并查集 + 贪心 +二分 )
- ZOJ 2332 网络流英文阅读题
- ZOJ 3761 Easy billiards 月赛E DFS