The 2014 ACM-ICPC Asia Mudanjiang Regional Contest - D

Domination

---

Time Limit: 8 Seconds       Memory Limit: 131072 KB       Special Judge

---

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

Every day after work, Edward will place a chess piece on a random empty cell. A few days later, he found the chessboard was dominated by 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

2
1 3
2 2

Sample Output

3.000000000000
2.666666666667

---

Author: JIANG, Kai

这题是概率dp，在现场赛的时候压根就不会做= =，以前根本dp就比较弱，第一次参加区域赛还是没有经验，实力也比较薄弱，这接下来的一年中要多补补题了。看了大神的blog，要写出状态转移式，这题设dp[i][j][k]代表已经有i行有棋子，j列有棋子 ， 已经用了k只棋子。然后转移出四个状态，旗子放在新的行列上：dp[i][j][k]=dp(i+1,j+1,k+1)*(n*m-(i*m+j*n-i*j))/(n*m-k);

放在新的行旧的列：dp[i][j][k]=dp(i+1,j,k+1)*(j*n-i*j)/(n*m-k);

放在旧的行新的列：dp[i][j][k]=dp(i,j+1,k+1)*(i*m-i*j)/(n*m-k);

放在旧的行旧的列：dp[i][j][k]=dp(i,j,k+1)*(i*j-k)/(n*m-k);

具体的解决过程还是看人家大神的blog:http://www.cnblogs.com/hlmark/p/4025523.html;

#include <iostream>
#include <cstdio>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include<ctime>
#define esp 1e-6
#define inf 0x0f0f0f0f
using namespace std;
#define max 110
int n,m;
int vis[55][55][55*55];
double dp1[55][55][55*55];
double dp(int i,int j,int k)
{

    if(i>=n&&j>=m)
        return 0.0;
    if(vis[i][j][k]==0)
    {
        double ans=0.0;
        vis[i][j][k]=1;
    if(i<n&&j<m&&(n*m-(i*m+j*n-i*j))>0)
        ans+=dp(i+1,j+1,k+1)*(n*m-(i*m+j*n-i*j))/(n*m-k);
    if(i<n&&(j*n-i*j)>0)
        ans+=dp(i+1,j,k+1)*(j*n-i*j)/(n*m-k);
    if(j<m&&(i*m-i*j)>0)
        ans+=dp(i,j+1,k+1)*(i*m-i*j)/(n*m-k);
    if(i*j-k>0)
        ans+=dp(i,j,k+1)*(i*j-k)/(n*m-k);
    ans+=1.0;
    dp1[i][j][k]=ans;
    }
    return dp1[i][j][k];
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        memset(vis,0,sizeof(vis));
        memset(dp1,0,sizeof(dp1));
        scanf("%d%d",&n,&m);
        printf("%.12f\n",dp(0,0,0));
    }
}