Codeforces 148D D Bag of mice(概率dp1)
2016-05-03 15:12
218 查看
D. Bag of mice
time limit per test2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Input
The only line of input data contains two integers
w and b (0 ≤ w, b ≤ 1000).
Output
Output the probability of the princess winning. The answer is considered to be correct if its absolute or relative error does not exceed
10 - 9.
Examples
Input
1 3
Output
0.500000000
Input
5 5
Output
0.658730159
Note
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
dp[i][j]表示当有i只白老鼠j只黑老鼠是公主赢得概率。
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
using namespace std;
const int N = 1050;
double dp
;
int w, b;
int main()
{
memset(dp, 0, sizeof(dp));
cin >> w >> b;
for (int i = 1; i <= w; i++) dp[i][0] = 1.0;
for (int i = 1; i <= w; i++)
{
for (int j = 1; j <= b; j++)
{
dp[i][j] = (double)i / (i + j);
if (j > 2)
{
dp[i][j] += (double)j / (i + j)*(double)(j - 1) / (i + j - 1)*
(double)(j - 2) / (i + j - 2)*dp[i][j - 3];//公主拿黑猫,龙拿黑猫,跳出黑猫
}
if (j > 1)
{
dp[i][j] += (double)j / (i + j)*(double)(j - 1) / (i + j - 1)*
(double)(i) / (i + j - 2)*dp[i - 1][j - 2];//公主拿黑猫,龙拿黑猫,跳出白猫
}
}
}
printf("%.9lf\n", dp[w][b]);
return 0;
}
相关文章推荐
- 详解Android应用中屏幕尺寸的获取及dp和px值的转换
- 基于Android中dp和px之间进行转换的实现代码
- Android中dip、dp、sp、pt和px的区别详解
- LFC1.0.0 版本发布
- Android px、dp、sp之间相互转换
- HP data protector软件学习1--基本角色与基本工作流程
- HP data protector软件学习2--软件组成与界面介绍
- android中像素单位dp、px、pt、sp的比较
- Android对px和dip进行尺寸转换的方法
- Android根据分辨率进行单位转换-(dp,sp转像素px)
- android 尺寸 dp,sp,px,dip,pt详解
- DP问题各种模型的状态转移方程
- POJ-1695-Magazine Delivery-dp
- nyoj-1216-整理图书-dp
- TYVJ1193 括号序列解题报告
- 对DP的一点感想
- TYVJ上一些DP的解题报告
- soj1005. Roll Playing Games
- Codeforces Round #197 (Div. 2)
- Codeforces Round #198 (Div. 1)