Codeforces 148D Bag of mice 简单概率dp

题目链接：Codeforces 148D Bag of mice

题目

Description

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

题目分析

两个人抽签，率先抽到白老鼠的人获胜，若直到抽完始终没有抽到白老鼠，后手胜。
这题其实不难 （codeforces1900分的题还能很难吗。。。）。就是最基本的抽签加上一个后手抽完后额外再去掉一只老鼠。稍加思考其实这题就很水。
用$p[i][j]$表示还剩$i$只白老鼠，$j$值黑老鼠的概率，这题里状态只能单向转移，所以不需要其他花里胡哨的操作。如果是公主抽$((m+n-i-j)\%3=0)$，则状态转移方程为$$res+=i/(i+j)\ast p[i][j]$$$$p[i][j-1]+=p[i][j]\ast j/(i+j)$$如果是龙抽，状态转移方程为$$p[i-1][j-1]+=p[i][j]\ast j\ast i/(i+j)/(i+j-1)$$$$p[i][j-2]+=p[i][j]\ast j\ast (j-1)/(i+j)/(i+j-1)$$不管哪一方，抽到白老鼠就意味着游戏的结束，所以这个状态就不需要转移了。然后注意一下$i=0,j=0$的情况要剔除，其他没什么了，上代码：

#include <cstdio>
#include <cstring>
using namespace std;

#define maxn 1005
double p[maxn][maxn];

int main()
{
	int b, w;
	scanf("%d%d", &w, &b);
	memset(p, 0, sizeof(p));
	p[w][b] = 1;
	double res = 0;
	for(int i = w; i >= 0; i--){
		for(int j = b; j >= 0; j--){
			if(i == 0 && j == 0) continue;
			double ii = i, jj = j;
			if((w+b-i-j) % 3 == 0){
				res += ii / (ii+jj) * p[i][j];
				if(j > 0) p[i][j-1] += p[i][j] * jj /(ii+jj);
			}
			else{
				if(j > 0){
					if(i > 0) p[i-1][j-1] += p[i][j] * jj * ii /(ii+jj) /(ii+jj - 1);
					if(j > 1) p[i][j-2] += p[i][j] * jj *(jj-1) /(ii+jj) /(ii+jj - 1);
				}
			}
		}
	}
	printf("%.9f\n", res);
}