Light OJ 1050 Marbles

  题意就不说啦！

  思路：递推也是可以做到的，我是比较傻逼的用记忆化搜索写的，开始没注意到边界条件ＷＡ了，属于比较傻逼的题目，囧！

　

#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <map>
#include <vector>
#include <set>
#include <string>
#define PB push_back
#define FT first
#define SD second
#define MP make_pair
#define INF (0x3f3f3f3f)*2
using namespace std;
typedef long long LL;
typedef pair<int,int>  P;
const int maxn=505,MOD=7+1e9;
double dp[maxn][maxn];
double dfs(int r,int b)
{
    if(r==0&&b>=1) return dp[r][b]=1.0;
    if(r!=0&&b==0) return dp[r][b]=0.0;
    if(dp[r][b]>=0) return dp[r][b];
    dp[r][b]=0.0;
    if(r>=1) dp[r][b]+=1.0*r/(r+b)*dfs(r-1,b-1);
    if(b>=2) dp[r][b]+=1.0*b/(r+b)*dfs(r,b-2);
    return dp[r][b];
}
int main()
{
        //freopen("E:/ACM_code/in.txt","r",stdin);
        //freopen("out.txt","w",stdout);
        int T,ca=0;
        scanf("%d",&T);
        for(int i=0;i<maxn;i++)
            for(int j=0;j<maxn;j++) dp[i][j]=-1.0;
        while(T--){
            int a,b;
            scanf("%d%d",&a,&b);
            dfs(a,b);
            printf("Case %d: ",++ca);
            printf("%.10lf\n",dp[a][b]);
        }
        //system("pause");
        return 0;
}