CodeForces 148D Bag of mice（概率DP）

D. Bag of mice

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 exceed10 - 9.

Examples

input

1 3

output

0.500000000

input

5 5

output

0.658730159

题目大意：恶龙与公主关于新年夜的计划产生了分歧，他们决定从一个装有w只白鼠和b只黑鼠的袋子里抓老鼠，谁先抓到白鼠谁就获胜（公主先抓）。由于恶龙比较暴躁，所以他抓一只老鼠出来，会有一只老鼠由于受到惊吓从袋子里逃出来，这只老鼠不被认定为抓出来的，而公主抓老鼠的时候则不会出现这种情况。如果最后袋子中没有老鼠并且没有人抓到白鼠，那么恶龙胜利。每只老鼠被抓到与从袋子中逃出都是等可能的。

解题思路：定义dp[i][j]为袋中还有i只白鼠与j只黑鼠时公主胜利的概率，显然，dp[i][0] = 1。当j大于零时

（1）公主第抓到白鼠的概率为i / (i + j)

（2）公主没有抓到白鼠而恶龙抓到白鼠的概率为j / (i + j) * i / (i + j - 1)；

（3）公主抓到黑鼠，恶龙也抓到黑鼠，逃出一只黑鼠的概率为j / (i + j) * (j - 1) / (i + j - 1) * (j - 2) / (i + j - 2) * dp[i][j - 3] (j >=3)

（4）公主抓到黑鼠，恶龙抓到黑鼠，逃出一只白鼠的概率为j / (i + j) * (j - 1) / (i + j - 1) * i / (i + j - 2) * dp[i - 1][j - 2]    (j >= 2)

dp[i][j]为（1）、（3）、（4）三种情况之和。

代码如下：

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>

using namespace std;

const int maxn = 1005;
const double eps = 1e-9;

double dp[maxn][maxn];

int main()
{
    int w,b;
    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 >= 2){
                    dp[i][j] += (double)j / (i + j) * (double)(j - 1) / (i + j - 1) * (double)i / (i + j - 2) * dp[i - 1][j - 2];
                }
                if(j >= 3){
                    dp[i][j] += (double)j / (i + j) * (double)(j - 1) / (i + j - 1) * (double)(j - 2) / (i + j - 2) * dp[i][j - 3];
                }
            }
        }
        printf("%.9f\n",dp[w][b]);
    }
    return 0;
}