Examining the Rooms
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1305 Accepted Submission(s): 796
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
Hint
Sample Explanation
When N = 3, there are 6 possible distributions of keys:
Room 1 Room 2 Room 3 Destroy Times
#1 Key 1 Key 2 Key 3 Impossible
#2 Key 1 Key 3 Key 2 Impossible
#3 Key 2 Key 1 Key 3 Two
#4 Key 3 Key 2 Key 1 Two
#5 Key 2 Key 3 Key 1 One
#6 Key 3 Key 1 Key 2 One
In the first two distributions, because Key 1 is locked in Room 1 itself and you can’t destroy Room 1, it is impossible to open Room 1.
In the third and forth distributions, you have to destroy Room 2 and 3 both. In the last two distributions, you only need to destroy one of Room 2 or Room
Source
题解：
给出N个房间，每个房间的钥匙随机放在某个房间内，概率相同。有K次炸门的机会，求能进入所有房间的可能性为多大。
dp[i][j]代表i个房间形成j个环的总数；
则dp[i][j]=(i-1)*dp[i-1][j]+dp[i-1][j-1];
由于1号房间不能被砸，所以dp[i][j]-dp[i-1][j-1]（减去1号房间被砸的总数）代表1号房间不被砸的总数，结果从1加到k除以总方案数（n的阶乘）即可；
代码：
#include<cstdio> #include<iostream> #include<cmath> #include<algorithm> #include<cstring> using namespace std; const int INF=0x3f3f3f3f; #define mem(x,y) memset(x,y,sizeof(x)) #define SI(x) scanf("%d",&x) #define PI(x) printf("%d",x) typedef long long LL; //S（P,K）=(P-1)*S(P-1,K)+S(P-1,K-1) LL dp[25][25]; void db(){ for(int i=1;i<=20;i++){ dp[i][0]=0; dp[i][i]=1; for(int j=1;j<i;j++) dp[i][j]=(i-1)*dp[i-1][j]+dp[i-1][j-1]; } } LL fac(int n){ LL temp=1; while(n>1){ temp*=n; n--; } return temp; } int main(){ int T,N,K; mem(dp,0); db(); SI(T); while(T--){ scanf("%d%d",&N,&K); LL ans=0; for(int i=1;i<=K;i++)ans+=dp[N][i]-dp[N-1][i-1]; printf("%.4lf ",1.0*ans/fac(N)); } return 0; }