HDU 5003 Osu!

最新推荐文章于 2019-09-15 17:46:03 发布

lizhaowei213

最新推荐文章于 2019-09-15 17:46:03 发布

阅读量457

点赞数

CC 4.0 BY-SA版权

分类专栏：模拟&水

本文链接：https://blog.youkuaiyun.com/lizhaowei213/article/details/48392837

模拟&水专栏收录该内容

50 篇文章

订阅专栏

本文介绍了一个osu!音乐游戏积分系统的计算器实现，包括输入处理、数据排序和积分计算等关键步骤。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 a _i will add 0.95^(i-1)*a _i to your total score.

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 a ₁, a ₂, ..., a _n separated by a single space, denoting the score of each song.

T<=20, n<=50, 1<=a _i<=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.

Sample Input

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 55
using 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;
}