zoj 3468

Dice war is a board game. In each turn, the attacker will choose a pile of dices to attack the defender's pile of dices. They will roll the all dices, and the attacker will win if and only if the total number on all his dices is larger than the defenders. After a successful attack, the attacker's pile of dices will split into two piles, while one of them has only one dice. If the attacker loses, this pile will lose all dices except one. An attack cannot be made with a pile of one single dice.

Input

Multiple cases. Each case contains two number of dices in the attacker's pile and the diffender's pile. In the game, number of dices in a pile will be no more than 8.

Output

For each case, output the probability of attack success in a single line. Error no more than 1e-4 will be accepted.

Sample Input

3 2
2 1

Sample Output

0.7785493827160493
0.8379629629629629

ZOJ月赛的题目，大意是输入a和b所拥有的骰子的数量，求出a掷出的点数比b大的概率。比如输入3和2就是说a有3个骰子，b有2个骰子，

求出a的点数比b大的概率。

因为骰子数量较少，最大只有8个，所以直接暴力解决~~~

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

int p[9][49];
double ans[9][9];

void calc( int number )
{
	for(int i=number-1; i<=(number-1)*6; i++)
	{
		for(int j=1; j<=6; j++)
		{
			p[number][i+j] += p[number-1][i];
		}
	}
}

int main()
{
	memset(p,0,sizeof(p));
	memset(ans,0,sizeof(ans));
	int i;
	for(i=1; i<=6; i++)
	{
		p[1][i] = 1;
	}
	p[0][0] = 1;
	for(i=2; i<=8; i++)
	{
		calc(i);
	}
	int a,d;
	double sum = 0;
	for(a=1; a<=8; a++)
	{
		for(d=1; d<=8; d++)
		{
			for(i=a; i<=a*6; i++)
			{
				for(int j=d; j<=d*6; j++)
				{
					if(i>j)
					{
						sum += (double)p[a][i]*p[d][j];
					}
				}
			}
			ans[a][d] = sum/pow(6,(double)(a+d));
			sum = 0;
		}
	}
	while(scanf("%d%d",&a,&d)!=EOF)
	{
		
		printf("%.16lf/n",ans[a][d]);
		sum = 0.0;
	}
	return 0;
}