【CF148D】【D. Bag of mice】【概率dp】
来源:互联网 发布:java电商项目简历 编辑:程序博客网 时间:2024/05/20 04:49
The dragon and the princess are arguing about what to do on the New Year's Eve. The dragon suggests flying to the mountains to watch fairies dancing in the moonlight, while the princess thinks they should just go to bed early. They are desperate to come to an amicable agreement, so they decide to leave this up to chance.
They take turns drawing a mouse from a bag which initially contains w white and b black mice. The person who is the first to draw a white mouse wins. After each mouse drawn by the dragon the rest of mice in the bag panic, and one of them jumps out of the bag itself (the princess draws her mice carefully and doesn't scare other mice). Princess draws first. What is the probability of the princess winning?
If there are no more mice in the bag and nobody has drawn a white mouse, the dragon wins. Mice which jump out of the bag themselves are not considered to be drawn (do not define the winner). Once a mouse has left the bag, it never returns to it. Every mouse is drawn from the bag with the same probability as every other one, and every mouse jumps out of the bag with the same probability as every other one.
The only line of input data contains two integers w and b (0 ≤ w, b ≤ 1000).
Output the probability of the princess winning. The answer is considered to be correct if its absolute or relative error does not exceed10 - 9.
1 3
0.500000000
5 5
0.658730159
Let's go through the first sample. The probability of the princess drawing a white mouse on her first turn and winning right away is 1/4. The probability of the dragon drawing a black mouse and not winning on his first turn is 3/4 * 2/3 = 1/2. After this there are two mice left in the bag — one black and one white; one of them jumps out, and the other is drawn by the princess on her second turn. If the princess' mouse is white, she wins (probability is 1/2 * 1/2 = 1/4), otherwise nobody gets the white mouse, so according to the rule the dragon wins.
#include <iostream>#include <cstring>#include <cmath>#include <queue>#include <stack>#include <list>#include <map>#include <set>#include <string>#include <cstdlib>#include <cstdio>#include <algorithm>using namespace std;int w,b;double dp[1010][1010];int main(){ while(scanf("%d%d",&w,&b) != EOF){memset(dp,0,sizeof(dp));for(int i=1;i<=w;i++) dp[i][0] = 1;for(int i=1;i<=w;i++){for(int j=1;j<=b;j++){dp[i][j] += ((double)i) / (i +j);if(j >= 3){dp[i][j] += ((double)j)*(j-1)*(j-2)/(i+j)/(i+j-1)/(i+j-2)*dp[i][j-3];}if(j >= 2){dp[i][j] += ((double)j)*(j-1)*i/(i+j)/(i+j-1)/(i+j-2)*dp[i-1][j-2];}}}printf("%.9lf\n",dp[w][b]);} return 0;}
- 【CF148D】【D. Bag of mice】【概率dp】
- CF148D. Bag of mice(概率DP)
- CF148D--Bag of mice+概率期望dp
- 概率DP基础 CF148D Bag of mice
- CF D. Bag of mice(概率dp)
- Codeforces 148D D Bag of mice(概率dp)
- codeforces 148D D. Bag of mice(概率dp)
- codeforces 148D Bag of mice DP 概率
- 148D Bag of mice - 简单概率dp
- Codeforces 148D - Bag of mice 概率dp
- CF 148D Bag of mice (概率DP)
- [CF 148D]Bag of mice[概率DP]
- CodeForces 148D Bag of mice —— 概率DP
- codeforces-148D-Bag of mice-概率DP
- codeforces 148 D Bag of mice(概率dp)
- CF 148D Bag of mice 概率DP
- codeforces 148 D. Bag of mice(概率dp)
- codeforces 148 D. Bag of mice 概率dp
- hdu1010Tempter of the Bone(dfs+奇偶剪枝)
- 黑马程序员——集合框架类(Collections、Arrays)
- uva 1343 IDA*
- leetcode-110:判断平衡二叉树 Java
- CSS选择器
- 【CF148D】【D. Bag of mice】【概率dp】
- centOS 6.3 上配置SVN服务器
- Web Storage实现简单的留言本
- HDOJ 4463 Outlets 最小生成树
- 公式画图
- Struts2中的ModelDriven机制及其运用
- linux下Mysql乱码问题的处理
- php使用curl post 乱码 淘宝手机 curl 注意事项 cookie无法传递
- Mark Knowledge of Java Thread (2): Notify and Wait