poj Collecting Bugs 2096 (DP)
2016-02-26 10:30
441 查看
Collecting Bugs
Description
Ivan is fond of collecting. Unlike other people who collect post stamps, coins or other material stuff, he collects software bugs. When Ivan gets a new program, he classifies all possible bugs into n categories. Each day he discovers
exactly one bug in the program and adds information about it and its category into a spreadsheet. When he finds bugs in all bug categories, he calls the program disgusting, publishes this spreadsheet on his home page, and forgets completely about the program.
Two companies, Macrosoft and Microhard are in tight competition. Microhard wants to decrease sales of one Macrosoft program. They hire Ivan to prove that the program in question is disgusting. However, Ivan has a complicated problem. This new program has s
subcomponents, and finding bugs of all types in each subcomponent would take too long before the target could be reached. So Ivan and Microhard agreed to use a simpler criteria --- Ivan should find at least one bug in each subsystem and at least one bug of
each category.
Macrosoft knows about these plans and it wants to estimate the time that is required for Ivan to call its program disgusting. It's important because the company releases a new version soon, so it can correct its plans and release it quicker. Nobody would be
interested in Ivan's opinion about the reliability of the obsolete version.
A bug found in the program can be of any category with equal probability. Similarly, the bug can be found in any given subsystem with equal probability. Any particular bug cannot belong to two different categories or happen simultaneously in two different subsystems.
The number of bugs in the program is almost infinite, so the probability of finding a new bug of some category in some subsystem does not reduce after finding any number of bugs of that category in that subsystem.
Find an average time (in days of Ivan's work) required to name the program disgusting.
Input
Input file contains two integer numbers, n and s (0 < n, s <= 1 000).
Output
Output the expectation of the Ivan's working days needed to call the program disgusting, accurate to 4 digits after the decimal point.
Sample Input
Sample Output
Time Limit: 10000MS | Memory Limit: 64000K | |
Total Submissions: 4103 | Accepted: 2035 | |
Case Time Limit: 2000MS | Special Judge |
Ivan is fond of collecting. Unlike other people who collect post stamps, coins or other material stuff, he collects software bugs. When Ivan gets a new program, he classifies all possible bugs into n categories. Each day he discovers
exactly one bug in the program and adds information about it and its category into a spreadsheet. When he finds bugs in all bug categories, he calls the program disgusting, publishes this spreadsheet on his home page, and forgets completely about the program.
Two companies, Macrosoft and Microhard are in tight competition. Microhard wants to decrease sales of one Macrosoft program. They hire Ivan to prove that the program in question is disgusting. However, Ivan has a complicated problem. This new program has s
subcomponents, and finding bugs of all types in each subcomponent would take too long before the target could be reached. So Ivan and Microhard agreed to use a simpler criteria --- Ivan should find at least one bug in each subsystem and at least one bug of
each category.
Macrosoft knows about these plans and it wants to estimate the time that is required for Ivan to call its program disgusting. It's important because the company releases a new version soon, so it can correct its plans and release it quicker. Nobody would be
interested in Ivan's opinion about the reliability of the obsolete version.
A bug found in the program can be of any category with equal probability. Similarly, the bug can be found in any given subsystem with equal probability. Any particular bug cannot belong to two different categories or happen simultaneously in two different subsystems.
The number of bugs in the program is almost infinite, so the probability of finding a new bug of some category in some subsystem does not reduce after finding any number of bugs of that category in that subsystem.
Find an average time (in days of Ivan's work) required to name the program disgusting.
Input
Input file contains two integer numbers, n and s (0 < n, s <= 1 000).
Output
Output the expectation of the Ivan's working days needed to call the program disgusting, accurate to 4 digits after the decimal point.
Sample Input
1 2
Sample Output
3.0000
#include<stdio.h> #include<string.h> #include<math.h> #include<algorithm> #define ll long long #define N 1010 using namespace std; double dp ; int main() { int n,m,i,j,k; while(scanf("%d%d",&n,&m)!=EOF) { dp [m]=0; for(i=m-1;i>=0;i--) dp [i]=(m*1.0)/(m-i)+dp [i+1]; for(i=n-1;i>=0;i--) dp[i][m]=(n*1.0)/(n-i)+dp[i+1][m]; for(i=n-1;i>=0;i--) { for(j=m-1;j>=0;j--) { dp[i][j]=((n-i)*j*dp[i+1][j]+i*(m-j)*dp[i][j+1]+(n-i)*(m-j)*dp[i+1][j+1]+n*m)/(n*m-i*j); } } printf("%.4f\n",dp[0][0]); } return 0; }
相关文章推荐
- Android尺寸标注设计大全和Android切图规范
- RMAN Catalog 和 Nocatalog 的区别
- 神通广大的CSS3选择器
- IOS开发之----常用函数和常数
- C/C++ struct/class/union内存对齐
- 使用Animation-list实现等待旋转圆圈动画
- 几何着色器
- UIApplicationMain
- iOS 网络
- 小黑小波比.coding的使用
- Qt 5.4错误"qt.network.ssl: QSslSocket: cannot call"
- flume 报File Channel transaction capacity cannot be greater than the capacity of the channel capacity错误
- 陕南是哪里?陕南是哪几个市?
- arm9+linux fl2440之按键驱动 plat_button.c
- linux修改密码
- 如何向外行解释产品经理频繁更改需求为什么会令程序员烦恼?
- elgnairT.120
- [linux学习]centos下mysql的简单使用教程
- android开发之MVC、MVP、MVVM
- 变换反馈