# poj2096 Collecting Bugs[期望dp]

2022年11月23日
0 收藏 453 点赞 2,789 浏览 2870 个字

Collecting Bugs

 Time Limit: 10000MS Memory Limit: 64000K Total Submissions: 5394 Accepted: 2670 Case 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.

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`

Source

Northeastern Europe 2004, Northern Subregion

`/*dp求期望逆推求解题意：（题意看题目确实比较难道，n和s都要找半天才能找到）   一个软件有s个子系统，会产生n种bug   某人一天发现一个bug,这个bug属于一个子系统，属于一个分类   每个bug属于某个子系统的概率是1/s,属于某种分类的概率是1/n   问发现n种bug,每个子系统都发现bug的天数的期望。求解：         dp[i][j]表示已经找到i种bug,j个系统的bug，达到目标状态的天数的期望         dp[n][s]=0;要求的答案是dp[0][0];         dp[i][j]可以转化成以下四种状态:              dp[i][j],发现一个bug属于已经有的i个分类和j个系统。概率为(i/n)*(j/s);              dp[i][j+1],发现一个bug属于已有的分类，不属于已有的系统.概率为 (i/n)*(1-j/s);              dp[i+1][j],发现一个bug属于已有的系统，不属于已有的分类,概率为 (1-i/n)*(j/s);              dp[i+1][j+1],发现一个bug不属于已有的系统，不属于已有的分类,概率为 (1-i/n)*(1-j/s);　　　　　　　　累加上面四项的值*概率，再加上1（下一步打到目标状态的天数）　　　　　　　　最后在除以（1-（i*j）/（n*s））只保留合法期望（具体为什么wo ye bu zhi dao）        整理化简便得到转移方程*/#include<cstdio>#include<algorithm>typedef double DB;using namespace std;const int N=;double f[N][N];int n,s;int main(){    while(~scanf("%d%d",&n,&s)){        f[n][s]=;        for(int i=n;~i;i--){            for(int j=s;~j;j--){                if(i==n&&j==s) continue;                f[i][j]=(i*(s-j)*f[i][j+]+                        (n-i)*j*f[i+][j]+                        (n-i)*(s-j)*f[i+][j+]+                        n*s)/(n*s-i*j);            }        }        printf("%.4f\n",f[][]);    }    return ;} `

python开发_常用的python模块及安装方法

Educational Codeforces Round 11 C. Hard Process 二分
C. Hard Process题目连接：http://www.codeforces.com/contest/660/problem/CDes…

zengkefu@server1:/usr/src\$ uname -aLinux server1 4.10.0-19-generic #21…

Android调用系统相机、自定义相机、处理大图片
Android调用系统相机和自定义相机实例本博文主要是介绍了android上使用相机进行拍照并显示的两种方式，并且由于涉及到要把拍到的照片显…

Struts的使用

400-888-8888

ceotheme@ceo.com