ZOJ 3822 Domination（概率DP）

思路：一道比较简单的概率DP，转移方程见代码

#include<iostream>#include<cstdio>#include<cmath>using namespace std;int T;double dp[55][55][2550];int main(){scanf("%d",&T);while(T--){        int n,m;scanf("%d%d",&n,&m);int sum = n*m;for(int k = 1;k<=sum;k++)for(int i = 1;i<=n;i++)for(int j = 1;j<=m;j++)dp[i][j][k]=0.0;dp[0][0][0]=1.0;for (int k = 1;k<=sum;k++)for(int i = 1;i<=n;i++)for(int j = 1;j<=m;j++){dp[i][j][k]+=(dp[i][j][k-1]*(i*j-k+1)*1.0 / (sum-k+1));                    dp[i][j][k]+=(dp[i-1][j][k-1]*(n-i+1)*j*1.0 / (sum-k+1));dp[i][j][k]+=(dp[i][j-1][k-1]*(m-j+1)*i*1.0 / (sum-k+1));dp[i][j][k]+=(dp[i-1][j-1][k-1]*(n-i+1)*(m-j+1)*1.0 / (sum-k+1));}double ans = 0.0;for(int k = 1;k<=sum;k++)ans+=(dp[n][m][k]-dp[n][m][k-1])*k;printf("%.12lf\n",ans);}}

Description

Edward is the headmaster of Marjar University. He is enthusiastic about chess and often plays chess with his friends. What's more, he bought a large decorative chessboard with N rows and M columns.

Every day after work, Edward will place a chess piece on a random empty cell. A few days later, he found the chessboard was dominatedby the chess pieces. That means there is at least one chess piece in every row. Also, there is at least one chess piece in every column.

"That's interesting!" Edward said. He wants to know the expectation number of days to make an empty chessboard of N × M dominated. Please write a program to help him.

Input

There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

There are only two integers N and M (1 <= N, M <= 50).

Output

For each test case, output the expectation number of days.

Any solution with a relative or absolute error of at most 10^-8 will be accepted.

Sample Input

21 32 2

Sample Output

3.0000000000002.666666666667