日韩性视频-久久久蜜桃-www中文字幕-在线中文字幕av-亚洲欧美一区二区三区四区-撸久久-香蕉视频一区-久久无码精品丰满人妻-国产高潮av-激情福利社-日韩av网址大全-国产精品久久999-日本五十路在线-性欧美在线-久久99精品波多结衣一区-男女午夜免费视频-黑人极品ⅴideos精品欧美棵-人人妻人人澡人人爽精品欧美一区-日韩一区在线看-欧美a级在线免费观看

歡迎訪問 生活随笔!

生活随笔

當前位置: 首頁 > 编程资源 > 编程问答 >内容正文

编程问答

hdu-5003 Osu!(水题)

發布時間:2025/3/15 编程问答 23 豆豆
生活随笔 收集整理的這篇文章主要介紹了 hdu-5003 Osu!(水题) 小編覺得挺不錯的,現在分享給大家,幫大家做個參考.

題目鏈接:

Osu!

time Limit: 2000/1000 MS (Java/Others)???

?Memory Limit: 65536/65536 K (Java/Others)

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.

?

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.

?

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 1 2 530 478

?

Sample Output 984.1000000000 題意: 水題不說了; 思路: AC代碼: #include <bits/stdc++.h> using namespace std; const int N=1e6+5; typedef long long ll; const ll mod=1e9+7; int t,n; int a[1000]; int cmp(int x,int y) {return x>y; } int main() {scanf("%d",&t);while(t--){scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%d",&a[i]);}double ans=0;sort(a+1,a+n+1,cmp);for(int i=1;i<=n;i++){ans+=pow(0.95,i-1)*(double)a[i];}printf("%.10lf\n",ans);}return 0; }

?

轉載于:https://www.cnblogs.com/zhangchengc919/p/5408226.html

總結

以上是生活随笔為你收集整理的hdu-5003 Osu!(水题)的全部內容,希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯,歡迎將生活随笔推薦給好友。