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

题目大意：

有一个笼子，笼子里面有 $W$ 只白老鼠和 $B$ 只黑老鼠，然后公主和龙在玩一个游戏，每个人从笼子中抓出一个老鼠，如果是白色的那么这个人赢，否则继续，直到出现胜者。现在龙抓老鼠的时候比较毛躁，所以会跑掉一只老鼠（跑掉任意一只老鼠的概率是相等的），而公主不会。公主先抓，求公主赢的概率。

解题思路：

考虑DP，设 $dp[i][j]:公主先抓，剩余\ i\ 只白老鼠和\ j\ 只黑老鼠时公主赢的概率$。
(1) 如果当前老鼠为白色，那么公主一定赢，概率为 $\frac i{i+j}$
(2) 如果当前老鼠为黑色，那么公主要想赢，龙一定选择黑色，概率为 $\frac j{i+j}*\frac{j-1}{i+j-1}$， 在当前情况下，要跑掉一只老鼠：
如果跑掉的老鼠为白色, 公主想赢的概率为$\frac i{i+j-2}*dp[i-1][j-2]$
如果跑掉的老鼠为黑色, 公主想赢的概率为$\frac {j-2}{i+j-2}*dp[i][j-2]$
根据乘法原理，将第(2) 种情况累乘起来。
那么有如下方程成立：

$$dp[i][j]=\frac i{i+j}+\frac j{i+j}*\frac{j-1}{i+j-1}*(\frac{i}{i+j-2}*dp[i-1][j-2]+\frac{j-2}{i+j-2}*dp[i][j-3])$$

初始化DP
$dp[i][0]=1$
$dp[i][1]=\frac i{i+1}$
$dp[i][2]=\frac i{i+2}+\frac2{i+2}*\frac1{i+1}$
$dp[0][i]=0$

代码：

#include <iostream>
#include <string.h>
#include <string>
#include <algorithm>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <map>
using namespace std;
typedef long long LL;
const int MAXN = 1e3+5;
const double PI = acos(-1);
const double eps = 1e-8;
const LL MOD = 1e9+7;
double dp[MAXN][MAXN];
int main(){
    //freopen("C:/Users/yaonie/Desktop/in.txt", "r", stdin);
    //freopen("C:/Users/yaonie/Desktop/out.txt", "w", stdout);
    int W, B;
    while(~scanf("%d%d",&W, &B)){
        memset(dp, 0, sizeof(dp));
        for(int i=1; i<MAXN; i++) dp[i][0]=1, dp[i][1]=1.0*i/(i+1);
        for(int i=1; i<=W; i++){
            for(int j=2; j<=B; j++){
                double wi = 1.0*i/(i+j);
                double bj = 1.0*j*(j-1)/((i+j)*(i+j-1));
                if(j == 2){
                    dp[i][j] = wi+bj;
                    continue;
                }
                double wii = 1.0*i/(i+j-2);
                double bjj = 1.0*(j-2)/(i+j-2);
                dp[i][j]=wi+bj*(wii*dp[i-1][j-2]+bjj*dp[i][j-3]);
            }
        }
        printf("%.9f\n",dp[W][B]);
    }
    return 0;
}