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.

 

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 one line for each case, indicating the corresponding possibility. Four digits after decimal point are preserved by rounding.

 

 

 

Source

 

第一类Stirling数 s(p,k)

　　  

s(p,k)的一个的组合学解释是：将p个物体排成k个非空循环排列的方法数。

s(p,k)的递推公式： s(p,k)=(p-1)*s(p-1,k)+s(p-1,k-1) ,1<=k<=p-1

边界条件：s(p,0)=0 ,p>=1  s(p,p)=1  ,p>=0

 

递推关系的说明：

考虑第p个物品，p可以单独构成一个非空循环排列，这样前p-1种物品构成k-1个非空循环排列，方法数为s(p-1,k-1)；

也可以前p-1种物品构成k个非空循环排列，而第p个物品插入第i个物品的左边，这有(p-1)*s(p-1,k)种方法。

 //2017-08-05

 #include <cstdio>

 #include <cstring>

 #include <iostream>

 #include <algorithm>

 #define ll long long 

 using namespace std;

 const int N = ;

 ll factorial[N], stir1[N][N];//factorial[n]存n的阶乘，stir1为第一类斯特林数

 int main()

 {

     int T, n, k;

     cin >> T;

     factorial[] = ;

     for(int i = ; i < N; i++)

           factorial[i] = factorial[i-]*i;

     memset(stir1, , sizeof(stir1));

     stir1[][] = ;

     stir1[][] = ;

     for(int i = ; i < N; i++){

           for(int j = ; j <= i; j++)

               stir1[i][j] = stir1[i-][j-] + (i-)*stir1[i-][j];

     }

     while(T--){

         cin>>n>>k;

         ll tmp = ;

         for(int i = ; i <= k; i++)

               tmp += stir1[n][i] - stir1[n-][i-];

         printf("%.4lf\n", (double)tmp*1.0/factorial[n]);

     }

     return ;

 }