UVA 10370
2014-09-08 14:59
204 查看
#include <iostream> #include <cstdio> using namespace std ; int main() { int c ; cin >> c ; while(c--) { int n ; cin >> n ; int d ; double sum = 0.0 ; for ( int i = 0 ; i < n ; ++i) cin >> d[i] ; for ( int i= 0 ;i < n ;++i) sum += d[i] ; double avg = sum / n ; int cnt = 0 ; for ( int i = 0 ; i< n ;++i) if (d[i] > avg) ++cnt ; printf("%.3lf%%\n", cnt *100.0/n) ; } return 0 ; }简单题
相关文章推荐
- UVA10370 Above Average
- UVA 10370 - Above Average
- UVa 10370 - Above Average
- UVA10370 Above Average
- UVA 488 10038 10107 10370
- uva 10370 - Above Average
- UVa 10370 Above Average (water ver.)
- UVA 10370
- PC/UVa 111002/10054 The Necklace
- UVA 11292 - Dragon of Loowater
- UVA 10537 The Toll! Revisited uva1027 Toll(最短路+数学坑)
- uva----10474
- uva 1329 - Corporative Network(数据结构:并查集)
- UVA 361 Cops and Robbers(凸包应用)
- UVa 12063 (DP) Zeros and Ones
- UVa 11081 - Strings(dp)
- hdu2296||UVALive 4223 Trucking (二分+spfa)
- UVA 315 Network 求割点、套版题 求割点
- UVa 1343 旋转游戏(dfs+IDA*)
- Funny Car Racing UVA - 12661 (当初就不该浪的最短路)