Collecting Bugs - POJ 2096 dp
来源:互联网 发布:战争雷霆pw42数据 编辑:程序博客网 时间:2024/05/02 02:32
Collecting Bugs
Time Limit: 10000MS Memory Limit: 64000KTotal Submissions: 2167 Accepted: 1037Case Time Limit: 2000MS Special Judge
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.
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
题意:一个软件有s个子系统,会产生n种bug,某人一天发现一个bug,这个bug属于一个子系统,属于一个分类每个bug属于某个子系统的概率是1/s,属于某种分类的概率是1/n,问发现n种bug,每个子系统都发现bug的天数的期望。
思路:递推,dp[i][j]可以表示成dp[i+1][j]*p1+d[i][j+1]*p2+dp[i+1][j+1]*p3+dp[i][j]*p4的形式,然后通过合并,可以得到dp[i][j]的表示方式。结果为dp[1][1]+1。
AC代码如下:
#include<cstdio>#include<cstring>using namespace std;double dp[1010][1010];int main(){ int i,j,k; double n,m; scanf("%lf%lf",&n,&m); dp[(int)n][(int)m]=0; for(i=n;i>=1;i--) { for(j=m;j>=1;j--) { if(!(i==n && j==m)) dp[i][j]=((n-i)/n*j/m*dp[i+1][j]+i/n*(m-j)/m*dp[i][j+1]+(n-i)/n*(m-j)/m*dp[i+1][j+1]+1)/(1-i/n*j/m); } } printf("%.4f\n",dp[1][1]+1);}
0 0
- Collecting Bugs - POJ 2096 dp
- poj 2096 Collecting Bugs DP
- DP--POJ - 2096 Collecting Bugs
- POJ 2096 Collecting Bugs 概率DP
- poj 2096 Collecting Bugs(期望DP)
- Poj 2096 Collecting Bugs (dp求期望)
- 概率dp-poj-2096-Collecting Bugs
- poj 2096 Collecting Bugs(概率DP)
- poj 2096 Collecting Bugs (概率dp)
- 概率dp POJ 2096 Collecting Bugs
- POJ-2096 Collecting Bugs 简单概率DP
- poj 2096 Collecting Bugs(概率dp)
- POJ 2096 Collecting Bugs (概率dp)
- POJ 2096 Collecting Bugs(概率dp)
- poj-2096-Collecting Bugs-概率DP
- POJ 2096 Collecting Bugs(概率dp)
- 概率DP POJ 2096 Collecting Bugs
- poj 2096 Collecting Bugs 概率dp
- 职位搜索的技巧—2014年求职六大技巧之二
- TOPO DN 解析
- uint64的压缩
- 看记录片《大师》之我见
- uva 357 Let Me Count The Ways
- Collecting Bugs - POJ 2096 dp
- FPGA研发(1)FPGA是个什么玩意?
- 十进制数与二进制, 八进制, 十六进制之间的转换
- 理解 process.initgroups(user, extra_group)
- uva 10620 - A Flea on a Chessboard(暴力+数学)
- 【iOS】Swift字符串截取方法的改进
- PHP range协议实现输出文件断点续传
- 提問的智慧
- 计算字符串的长度