HDU 3625 Examining the Rooms

HDU 3625 Examining the Rooms

题目链接：HDU 3625 Examining the Rooms

---

Problem Description

A murder happened in the hotel. As the best detective in the town, you should examine all the N rooms of the hotel immediately. However, all the doors of the rooms are locked, and the keys are just locked in the rooms, what a trap! You know that there is exactly one key in each room, and all the possible distributions are of equal possibility. For example, if N = 3, there are 6 possible distributions, the possibility of each is 1/6. For convenience, we number the rooms from 1 to N, and the key for Room 1 is numbered Key 1, the key for Room 2 is Key 2, etc.
To examine all the rooms, you have to destroy some doors by force. But you don’t want to destroy too many, so you take the following strategy: At first, you have no keys in hand, so you randomly destroy a locked door, get into the room, examine it and fetch the key in it. Then maybe you can open another room with the new key, examine it and get the second key. Repeat this until you can’t open any new rooms. If there are still rooms un-examined, you have to randomly pick another unopened door to destroy by force, then repeat the procedure above, until all the rooms are examined.
Now you are only allowed to destroy at most K doors by force. What’s more, there lives a Very Important Person in Room 1. You are not allowed to destroy the doors of Room 1, that is, the only way to examine Room 1 is opening it with the corresponding key. You want to know what is the possibility of that you can examine all the rooms finally.

Input

The first line of the input contains an integer T (T ≤ 200), indicating the number of test cases. Then T cases follow. Each case contains a line with two numbers N and K. (1 < N ≤ 20, 1 ≤ K < N).

Output

Output one line for each case, indicating the corresponding possibility. Four digits after decimal point are preserved by rounding.

Sample Input

3
3 1
3 2
4 2

Sample Output

0.3333
0.6667
0.6250

题意：

有n个锁着的房间和对应n扇门的n把钥匙，每个房间内有一把钥匙。你可以破坏一扇门，取出其中的钥匙，然后用取出钥匙打开另一扇门（如果取出的钥匙能打开房门则接着打开，取出其中钥匙，如此往复，若打不开则继续破坏一扇门）。最多可以破坏k（k<=n）扇门，但是编号为1的门只能用钥匙打开。求能打开所有门（被破坏或是被钥匙打开）的概率。

AC代码：

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <locale>
#include <vector>
#include <string>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <functional>

using namespace std;

int main()
{
    long long sum[21];
    long long s1[21][21];
    memset(sum,0,sizeof sum);
    memset(s1,0,sizeof s1);
    sum[0]=1;
    for(int i=1; i<21; i++)
        sum[i]=sum[i-1]*i;
    for(int i=1; i<21; i++)
    {
        s1[i][0]=0;
        s1[i][i]=1;
        for(int j=1; j<i; j++)
            s1[i][j]=s1[i-1][j-1]+(i-1)*s1[i-1][j];
    }
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n,k;
        scanf("%d%d",&n,&k);
        if(n==1||k==0)
        {
            printf("0.0000\n");
            continue;
        }
        long long res=0;
        for(int i=1; i<=k; i++)
            res+=s1[n][i]-s1[n-1][i-1];
        printf("%.4lf\n",(double)res/sum[n]);
    }
    return 0;
}