zoj 1915 Above Average
2014-09-02 14:59
225 查看
//%%输出百分号
#include<stdio.h> #include<stdlib.h> int main() { int times,n,*p,i,count; double aver; scanf("%d",×); while(times--){ scanf("%d",&n); p = (int *)malloc(n*sizeof(int)); aver = 0; for(i = 0;i<n;i++){ scanf("%d",&p[i]); aver += p[i]; } aver = aver *1.0 / n; count = 0; for(i = 0;i<n;i++) if(p[i]>aver) count++; printf("%.3lf%%\n",count*1.0/n*100); } return 0; }
相关文章推荐
- zoj 1915 Above Average
- zoj 1915 Above Average
- zoj1915--------------------Above Average
- ZOJ Problem Set–1915 Above Average
- ZOJ 1915 Above Average
- zoj 1915 Above Average(水~)
- 1915_Above Average(百分数的输出)
- ZOJ 1915
- ZOJ-1915
- zoj 1915
- zoj1078 Palindrom Numbers
- POJ 1915 Knight Moves
- zoj 2876 Phone List
- ZOJ 5579 Stean
- String Successor(ZOJ - 3490 )
- ZOJ Problem 1689 Calling Extraterrestrial Intelligence Again
- ZOJ 1649 - Rescue BFS/优先队列
- ZOJ 2770 Burn the Linked Camp
- zoj 3471 Most Powerful(状态压缩dp)
- HDU1113 POJ1318 UVA642 ZOJ1181 UVALive5328 Word Amalgamation【MAP+排序+水题】