ACM--steps--2.2.8--第一类stirling数
来源:互联网 发布:git ubuntu安装 编辑:程序博客网 时间:2024/05/20 03:05
Examining the Rooms
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 652 Accepted Submission(s): 370Problem 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.
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
33 13 24 2
Sample Output
0.33330.66670.6250<div style="" font-size:="" 14px;="" border-top:="" #b7cbff="" 1px="" dashed;="" font-family:="" times"="">HintSample ExplanationWhen N = 3, there are 6 possible distributions of keys:Room 1Room 2Room 3Destroy Times#1Key 1Key 2Key 3Impossible#2Key 1Key 3Key 2Impossible#3Key 2Key 1Key 3Two#4Key 3Key 2Key 1Two#5Key 2Key 3Key 1One#6Key 3Key 1Key 2OneIn 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
The 35th ACM/ICPC Asia Regional Tianjin Site —— Online Contest
Recommend
lcy
参考博文:http://blog.csdn.net/acm_cxlove/article/details/7857498
建立的数组一定要用long long。
第一类stirling给出恰好含有m个圈的n个数的排列数目。又一次感到身为数学系的学生,数学都学到猪身上去了。
建立的数组一定要用long long。
第一类stirling给出恰好含有m个圈的n个数的排列数目。又一次感到身为数学系的学生,数学都学到猪身上去了。
#include<iostream>#include<iomanip>using namespace std;long long dyx[21];//用以表示房间的一共可能的数目。long long wyx[21][21];//stirling数。int main(){ //第一类stirling数的递推公式为;s(p,k)=(p-1)*s(p-1,k)+s(p-1,k-1); //第一类stirling数给出恰好包含k个圈的p个数的排列数目。 int i,j; i=j=0; //先计算出房间里钥匙的一共的可能性。我们可以得出是房间数目的阶乘; dyx[0]=1; for(i=1;i<21;i++) { dyx[i]=dyx[i-1]*i; } //第一类stirling数的边界条件 wyx[0][0]=0; for(i=1;i<21;i++) { wyx[i][0]=0; wyx[i][i]=1; } //进行stirling数的计算。 for(i=1;i<=20;i++) { for(j=1;j<i;j++) { wyx[i][j]=(i-1)*wyx[i-1][j]+wyx[i-1][j-1]; } } int n,k,T; cin>>T; while(T--) { cin>>n>>k; if(n==1||k==0) { cout<<"0.0000"<<endl; continue; } //k表示最大破门数,即为最大圈数。 long long sum=0; for(j=1;j<=k;j++) { sum+=wyx[n][j]-wyx[n-1][j-1];//减去1自成1个圈的情况。 } cout<<fixed<<setprecision(4)<<(double)sum/dyx[n]<<endl;; } return 0;}
0 0
- ACM--steps--2.2.8--第一类stirling数
- 【笔记】第一类Stirling数和第二类Stirling数
- 第一类Stirling数和第二类Stirling数
- 第一类stirling数和第二类stirling数
- 【知识点】 --- 第一类Stirling数和第二类Stirling数
- 第一类Stirling 数 与 第二类Stirling 数
- 第一类Stirling数和第二类Stirling
- 第一类Stirling数和第二类Stirling
- 2014年山东省第五届ACM大学生程序设计竞赛--Hearthstone II(第一类Stirling数)
- [组合数学] 第一类,第二类Stirling数,Bell数
- [组合数学] 第一类,第二类Stirling数,Bell数
- 第一类、第二类Stirling数和Bell数
- 第一类,第二类Stirling数,Bell数
- [转]第一类Stirling数,第二类Stirling数,Bell数
- hdoj 3625 Examining the Rooms(第一类Stirling数)
- hdu 3625 Examining the Rooms 第一类stirling数
- HDU 3625 Examining the Rooms(第一类Stirling数)
- HDU 4372 Count the Buildings(第一类Stirling数)
- c中变量在栈中的地址
- codeforces 274B Zero Tree(树形dp)
- 安卓布局属性整理
- Apriori算法的java实现(星星学习笔记)
- iOS捕获异常,常用的异常处理方法
- ACM--steps--2.2.8--第一类stirling数
- poj1658
- Spring与Quartz的整合实现定时任务调度
- FragmentPagerAdapter.notifyDataSetChanged() 不起作用
- 啊哈C——学习5.3、5.4判断一个正整数是否为质数
- POJ1717 Dominoes DP,背包的变形
- iOS UITextView 输入内容实时更新cell的高度
- ORA-39212: installation error: XSL stylesheets not loaded correctly
- Groovy的调试环境