poj 2096 概率DP 解题报告
来源:互联网 发布:ios10软件不受信任 编辑:程序博客网 时间:2024/05/19 15:19
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
1 2
Sample Output
3.0000
思路
概率DP经典,很简单看代码
代码
WA
#include<cstdio> #include<iostream> #include<cstring>#include<algorithm> using namespace std; double dp[1005][1005]; int n,s; int main() { while(~scanf("%d%d",&n,&s)) { memset(dp,0,sizeof(dp)); dp[n][s]=0.0; int ns=n*s; for(int i=n;i>=0;i--) for(int j=s;j>=0;j--) { if(n==i&&s==j) continue; dp[i][j]=( ns + (n-i)*j*dp[i+1][j] + i*(s-j)*dp[i][j+1] + (n-i)*(s-j)*dp[i+1][j+1] )/( ns - i*j ); } printf("%lf",dp[0][0]); } return 0; }
AC
#include<cstring>#include<cstdio>#include<algorithm>#include<iostream>#include<cmath>using namespace std;const int N=1010;double dp[N][N];int n,s;int main(){ while(scanf("%d%d",&n,&s)!=EOF) { dp[n][s]=0; for (int i=n;i>=0;i--) for (int j=s;j>=0;j--) { if (i==n&&j==s) continue; dp[i][j]=(i*(s-j)*dp[i][j+1]+(n-i)*j*dp[i+1][j]+(n-i)*(s-j)*dp[i+1][j+1]+n*s)/(n*s-i*j); } printf("%.4f\n",dp[0][0]); return 0; }}
- POJ 2096 概率DP 解题报告
- poj 2096 概率DP 解题报告
- HDU4089概率dp解题报告
- poj 2096 期望DP 解题报告
- HDU 3853 概率DP 解题报告
- POJ2096 Collecting Bugs 解题报告【概率DP】
- Poj 1260 DP 解题报告
- POJ 1260 DP解题报告
- POJ 1160 DP 解题报告
- poj 2096 概率dp
- poj 2096 概率dp
- POJ 2096 概率dp
- poj 2096<概率dp>
- poj 2096 概率dp
- POJ 2096 概率dp
- poj 2096 概率dp
- POJ 2096 概率DP
- poj 2096 概率dp
- 1007 Financial Management
- ACM 格式化输出,杨辉三角
- 提高.Net程序猿工作效率的开发工具
- 模板--二叉搜索树
- tomcat部署项目,不加项目名自动跳转
- poj 2096 概率DP 解题报告
- 历史上的重大软件BUG启示录第9篇---微软的硬件尝试
- UVA1025ASpyInTheMetro
- 【Asp.net】--7大内置对象了解
- 游戏中录音功能的实现
- yum源的shell脚本配置
- kickstart自动应答脚本生成及虚拟机自动安装
- CSS3基础知识
- MyBatis之XML文件配置实现映射器Mapper