题意:有s个系统,有n种bug,bug的数量不限,一位程序员每天可以发现一个bug,现在求发现n种bug存在s个系统中并且每个系统都要被发现bug的平均天数(期望)。
思路:概率DP水题,用DP[i][j]表示已经有i种bug和j种系统后还需要达到目标状态的期望,那么答案就是dp[0][0].
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<ctime>
#define eps 1e-6
#define LL long long
#define pii pair<int, int>
//#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const int MAXN = 1000 + 5;
double dp[MAXN][MAXN];
int n, s;
int main() {
//freopen("input.txt", "r", stdin);
while(scanf("%d%d", &n, &s)==2) {
memset(dp, 0, sizeof(dp));
for(int i = s; i >= 0; i--) {
for(int j = n; j >= 0; j--) {
if(i==s&&j==n) continue;
double k = 1.0-(double)i*j/(s*n);
dp[i][j] += (double)(s-i)*(n-j)/(s*n)*dp[i+1][j+1];
dp[i][j] += (double)(n-j)*i/(s*n)*dp[i][j+1];
dp[i][j] += (double)(s-i)*j/(s*n)*dp[i+1][j];
dp[i][j] = (dp[i][j]+1.0)/k;
}
}
printf("%.4f\n", dp[0][0]);
}
return 0;
}