codeforces 148D Bag of mice （概率DP）【博弈模板】

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 bblack 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.

Example

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.

 【题解】

一个袋子里有w只白鼠和b只黑鼠，现在王妃和龙轮流从袋子中抓老鼠，王妃先抓，每次龙抓出一只老鼠后袋子中会跑出一只老鼠，谁先抓到白鼠就获胜，问王妃获胜的概率。

 分析：

设dp[i][j]为袋子中有i只白鼠，j只黑鼠时王妃的获胜概率，那么可以知道dp[i][0]一定是等于1的，dp[0][j]一定等于0；

然后整个过程不外乎四种情况：

① 王妃直接抓到白鼠；

② 王妃抓到黑鼠，龙抓到白鼠；

③ 王妃抓到黑鼠，龙抓到黑鼠，跑出一只黑鼠；

④ 王妃抓到黑鼠，龙抓到黑鼠，跑出一只白鼠；

前两种情况直接用，第三种情况要满足j>=3；第四种情况要满足j>=2；

【AC代码】

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N=1001;
double dp[N][N];//第一维代表白鼠数，第二维代表黑鼠数
int m,n;

int main()
{
    while(~scanf("%d%d",&m,&n))
    {
        memset(dp,0,sizeof dp);
        for(int i=1;i<=m;++i)
            dp[i][0]=1;//只有白鼠时一定赢
        for(int i=1;i<=m;++i)
            for(int j=1;j<=n;++j)
        {
            {
                dp[i][j]+=(double)i/(j+i);//直接抓到白的
                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];//王妃抓到黑的  龙抓到黑的  跑出一只黑的  
                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];//王妃抓到黑的  龙抓到黑的  跑出一只白的
            }
        }
        printf("%.9f\n",dp[m][n]);
    }
    return 0;
}