POJ - 2096 Collecting Bugs（期望DP）

题目链接
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.
题意：有n类bug和s个子系统，bug数量不限，且每天只能发现一个bug，要求的是当在s个子系统中发现n类bug时所需要天数的期望（平均天数）。
思路：dp[i][j]代表i个bug j个系统的期望天数 ，然后就是四种转移：新的系统新的bug 、旧的系统新的bug 、新的系统旧的bug 、旧的系统旧的bug 。

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
const int maxn=1e3+5;
double dp[maxn][maxn];//dp[i][j]代表i个bug j个系统的期望天数 
int main()
{
	int n,s;
	while(scanf("%d %d",&n,&s)!=EOF)
	{
		memset(dp,0,sizeof(dp));
		double p1,p2,p3,p4;
		for(int i=n;i>=0;--i)
		for(int j=s;j>=0;--j)
		{
			if(i==n&&j==s) continue;
			p1=(n-i)*(s-j)*1.0/(n*s);//新的系统新的bug 
			p2=j*(n-i)*1.0/(n*s);//旧的系统新的bug 
			p3=i*(s-j)*1.0/(n*s);//新的系统旧的bug 
			p4=i*j*1.0/(n*s);//旧的系统旧的bug 
			dp[i][j]=(dp[i+1][j+1]*p1+dp[i+1][j]*p2+dp[i][j+1]*p3+1)/(1-p4);
		}
		printf("%.4lf\n",dp[0][0]);
	}
}