传送门:http://www.lydsy.com/JudgeOnline/problem.php?id=1419
仰慕wyfcyx
Code:
#include<bits/stdc++.h>
using namespace std;
double f[2][5010];
int n,m,cur;
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++){
f[cur][0]=i;
for(int j=1;j<=m;j++)
f[cur][j]=max(.0,i/double(i+j)*(f[cur^1][j]+1)+j/double(i+j)*(f[cur][j-1]-1));
cur^=1;
}printf("%.6lf\n",f[cur^1][m]-5e-7);
return 0;
}