POJ 2096-Collecting Bugs（概率dp入门）-CSDN博客

题意：

有n种bug和s种系统bug,每天发现一种bug（可能已经发现过了）所有种bug被发现的概率相同，求所有bug被发现的期望天数。

分析：

dp[i][j]发现i种bug,j种系统bug期望天数，dp[n][s]=0;dp[0][0]即为所求

dp[i][j] = (n-i)*(s-j)/n/s*dp[i+1][j+1] + i*(s-j)/n/s*dp[i][j+1] + (n-i)*j/n/s*dp[i+1][j] +i*j/n/s*dp[i][j]+1;

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <vector>
#include <string>
#include <cctype>
#include <complex>
#include <cassert>
#include <utility>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
typedef pair<int,int> PII;
typedef long long ll;
#define lson l,m,rt<<1
#define pi acos(-1.0)
#define rson m+1,r,rt<<11
#define All 1,N,1
#define read freopen("in.txt", "r", stdin)
#define N 1010
const ll  INFll = 0x3f3f3f3f3f3f3f3fLL;
const int INF= 0x7ffffff;
const int mod =  1000000007;
using namespace std;
double dp[N][N];
int n, s;
double solve(){
    dp[n][s] = 0.0;
    for(int i = n; i >= 0; i--) {
        for(int j = s; j >= 0; j--)
        {
            if(i == n && j == s)continue;
            dp[i][j] = (n-i)*(s-j)*dp[i+1][j+1] + i*(s-j)*dp[i][j+1] + (n-i)*j*dp[i+1][j] + n*s;
            dp[i][j] /= n*s - i*j;
        }
    }
    return dp[0][0];
}
int main() {
    while(~scanf("%d%d",&n,&s))
        printf("%.4f\n", solve());
    return 0;
}