HDU 4586
来源:互联网 发布:都市小说改编的网络剧 编辑:程序博客网 时间:2024/06/04 19:57
Play the Dice
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1328 Accepted Submission(s): 429
Special Judge
Problem Description
There is a dice with n sides, which are numbered from 1,2,...,n and have the equal possibility to show up when one rolls a dice. Each side has an integer ai on it. Now here is a game that you can roll this dice once, if the i-th side is up, you will get ai yuan. What's more, some sids of this dice are colored with a special different color. If you turn this side up, you will get once more chance to roll the dice. When you roll the dice for the second time, you still have the opportunity to win money and rolling chance. Now you need to calculate the expectations of money that we get after playing the game once.
Input
Input consists of multiple cases. Each case includes two lines.
The first line is an integer n (2<=n<=200), following with n integers ai(0<=ai<200)
The second line is an integer m (0<=m<=n), following with m integers bi(1<=bi<=n), which are the numbers of the special sides to get another more chance.
The first line is an integer n (2<=n<=200), following with n integers ai(0<=ai<200)
The second line is an integer m (0<=m<=n), following with m integers bi(1<=bi<=n), which are the numbers of the special sides to get another more chance.
Output
Just a real number which is the expectations of the money one can get, rounded to exact two digits. If you can get unlimited money, print inf.
Sample Input
6 1 2 3 4 5 604 0 0 0 01 3
Sample Output
3.500.00
思路:一次投掷能拿sum/n;如果投掷到有颜色的m个面中的任意一个,会额外得到sum*m/n/n,以此类推,最终的期望就是sum/n*((n/m)^0+(n/m)^1+(n/m)^2+……)。等比数列求和公式,算出来是(1-(n/m)^∞)/(1-(n/m));当n == m时,(n/m)^∞ == 1,所以原式结果是0,当n !=m时,(n/m)^∞ 趋近于 0,则原式变为sum/n*/(1 - (n/m))也就是sum/(n-m)。
一开始写的递推公式,怎么都不过,后来发现无论是什么样例,结果都是sum/(n-m),交了一发竟然对了,后来才明白是这么回事。
#include<cstdio>#include<cstring>#include<algorithm>#include<iostream>#include<vector>#include<set>using namespace std;double ans,pre;int n;int main(){ int m; while(scanf("%d",&n)!=EOF) { ans = 0.00; for(int i = 0;i < n;i++) { int num; scanf("%d",&num); ans+=num; } scanf("%d",&m); for(int i = 0;i < m;i++) { int num; scanf("%d",&num); } if(ans == 0) { printf("0.00\n"); continue; } if(m == n) printf("inf\n"); else printf("%.2lf\n",ans/(n-m)); } return 0;}
0 0
- HDU 4586
- hdu 4586
- hdu 4586 (概率+期望)
- hdu 4586 概率dp
- HDU 4586 (数学)
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- 算法总结:【线段树+扫描线】&矩形覆盖求面积/周长问题(HDU 1542/HDU 1828)
- Qt之可重入与线程安全
- Mysql学习总结(3)——MySql语句大全:创建、授权、查询、修改等
- shell命令 grep不以某字符开头、ssh远程执行命令返回结果、ssh远程执行多个命令输入文件
- [算法学习笔记] AVL树----带有平衡条件的二叉搜索树
- HDU 4586
- 使用 CXF 做 webservice 简单例子
- Mysql学习总结(4)——MySql基础知识、存储引擎与常用数据类型
- 单链表反转/逆序
- AndroidStudio插件之GsonFormat
- Linux执行可执行文件提示No such file or directory的解决办法
- Reveal的使用--整理自唐巧的《iOS开发进阶》
- java旅行第三天
- Mysql学习总结(5)——MySql常用函数大全讲解