HDU 5003 Osu!
来源:互联网 发布:c语言http服务器 编辑:程序博客网 时间:2024/05/21 22:21
Osu!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1398 Accepted Submission(s): 655
Special Judge
Problem Description
Osu! is a famous music game that attracts a lot of people. In osu!, there is a performance scoring system, which evaluates your performance. Each song you have played will have a score. And the system will sort all you scores in descending order. After that, the i-th song scored ai will add 0.95^(i-1)*ai to your total score.
Now you are given the task to write a calculator for this system.
Now you are given the task to write a calculator for this system.
Input
The first line contains an integer T, denoting the number of the test cases.
For each test case, the first line contains an integer n, denoting the number of songs you have played. The second line contains n integers a1, a2, ..., an separated by a single space, denoting the score of each song.
T<=20, n<=50, 1<=ai<=500.
For each test case, the first line contains an integer n, denoting the number of songs you have played. The second line contains n integers a1, a2, ..., an separated by a single space, denoting the score of each song.
T<=20, n<=50, 1<=ai<=500.
Output
For each test case, output one line for the answer.
Your answers will be considered correct if its absolute error is smaller than 1e-5.
Your answers will be considered correct if its absolute error is smaller than 1e-5.
Sample Input
12530 478
Sample Output
984.1000000000
Source
2014 ACM/ICPC Asia Regional Anshan Online
Recommend
hujie | We have carefully selected several similar problems for you: 5431 5430 5429 5428 5427
2014年ACM/ICPC鞍山赛区的一道签到题。
#include <stdio.h>#include <math.h>#include <algorithm>#define N 55using namespace std;double num095[N];int a[N];void gettable(){ for(int i=0;i<=49;i++) num095[i]=pow(0.95,i);}bool cmp(int a,int b){ return a>b;}int main(){ int t; scanf("%d",&t); gettable(); while(t--) { int n; scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d",&a[i]); sort(a+1,a+n+1,cmp); double sum=0; for(int i=1;i<=n;i++) sum+=a[i]*1.0000*num095[i-1]; printf("%lf\n",sum); } return 0;}
0 0
- hdu 5003 Osu!(水题)
- hdu 5003 Osu!
- HDU oj Osu! 5003
- HDU 5003 Osu!
- HDU 5003 Osu!
- HDU 5003 Osu!(数学题)
- HDU 5003 Osu!(水题)
- 2014 鞍山网络赛 hdu 5003 Osu!
- HDU-#5003 Osu!(精度题)
- hdu 5078 Osu!
- [ACM] HDU 5078 Osu!
- hdu 5078 Osu!(水题)
- HDU 5078 Osu!
- HDU 5078 Osu!
- HDU 5078 Osu!
- HDU 5078--Osu!【水题】
- hdu 5078 Osu!
- hdu 5078 Osu!
- bootstrap modal 弹出其他页面
- js实现右键管理
- Android:Resources资源文件
- iOS 8 新特性autoLayout
- Git远程操作详解
- HDU 5003 Osu!
- iOS中键值监听KVO的学习
- UML
- Leetcode: Maximal Square
- 使用Intent调用系统其它程序打开本地各种类型的文件
- raspberry pi镜像压缩备份 linux
- 游戏中的路径动画设计与实现
- Host 'XXX' is not allowed to connect to this MySQL server 解决方法/开启MySQL远程账号
- Asp.net 三种事务处理