Play the Dice hdu 4586 数学期望的问题
来源:互联网 发布:电脑如何装mac系统 编辑:程序博客网 时间:2024/06/12 20:54
Play the Dice
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 710 Accepted Submission(s): 253
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
Source
2013 ACM-ICPC南京赛区全国邀请赛——题目重现
Recommend
zhuyuanchen520 | We have carefully selected several similar problems for you: 4822 4821 4820 4819 4818
这个题目其实想想还是蛮不容易,不过我给力的队友依旧还是做出了这个题目。假如说第一次所得期望是a的话,那么第二次所得到的期望就是a+a*(m/n),接着这样推下去,根据等比公式即可得到答案,而a=sum/n,
因为我们在第一次的时候期望就是sum/a,p=∑(n) a0 * q^(i-1), q = (m/n) , a0=sum/n
#include<iostream>#include<cstdio>#include<cstring>using namespace std;const int N=220;int a[N],b;int n,m;int main(){ while(~scanf("%d",&n)){ int sum=0; for(int i=0;i<n;i++){ scanf("%d",&a[i]); sum+=a[i]; } //printf("sum=%d\n",sum); scanf("%d",&m); for(int i=0;i<m;i++) scanf("%d",&b); if(sum==0){ printf("0.00\n"); continue; } if(n==m){ printf("inf\n"); continue; } printf("%.2lf\n",1.0*sum/(n-m)); } return 0;}
0 0
- Play the Dice hdu 4586 数学期望的问题
- HDU 4586 Play the Dice 数学期望
- HDU 4586 Play the dice (数学期望)
- Play the Dice(数学期望)
- HDU 4586 Play the Dice 概率期望
- Play the Dice - HDU 4586 期望dp
- HDU-4586 Play the Dice(概率期望)
- HDU 4518 Play the Dice(数学 概率 期望)
- HDU-4586 Play the Dice (数学)
- HDU 4586:Play the Dice (数学)
- 概率dp求期望-hdu-4586-Play the Dice
- hdu 4586 Play the Dice(水期望DP)
- hdu 4586 Play the Dice(概率期望题)
- HDU 4586 Play the Dice(概率+期望)
- HDU 4568 Play the Dice(期望)
- HDU 4586 Play the Dice
- HDU 4586 Play the Dice
- HDOJ 4586 Play the Dice【数学】
- pcduino lite wifi联网--工具准备,热身。
- ArcGIS 10.1 for Server 如何使用10或者之前的切片
- (3)CSS指定文本字体、加粗、倾斜、大小写等
- 【LeetCode】Swap Nodes in Pairs & Reverse Nodes in k-Group
- How to check graphics card on Linux
- Play the Dice hdu 4586 数学期望的问题
- Previous Permutation
- 采用Keepalived实现Redis双机高可用
- How to clean up disk space on Linux
- android 连续两次点击返回键 退出程序
- python简明教程
- .Net远程框架 RemotingException 服务器遇到内部错误
- 【STM32】启动模式 BOOT0/BOOT1的配置
- How to view or edit pdf/image metadata from command line on Linux