tc-SRM-626-DIV1-250

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <ctype.h>
#include <queue>
#include <map>
#include <algorithm>
using namespace std;
#define maxn 3001
#define LL long long
double x[52][2600];
double y[52][2600];
class FixedDiceGameDiv1
{
public:
double getExpectation(int a, int b, int c, int d)
{
if(a*b<c)return -1;
x[0][0]=1;
y[0][0]=1;
for(int i=0;i<a;i++)
{
for(int j=1;j<=55;j++)
{
for(int k=0;k<=2500;k++)
{
if(j<=b)x[i+1][k+j]+=x[i][k];
if(j<=d)y[i+1][k+j]+=y[i][k];
}
}
}
for(int i=1;i<=2500;i++)y[c][i]+=y[c][i-1];
double ans,num;
ans=num=0;
for(int i=1;i<=2500;i++)
{
ans+=i*y[c][i-1]*x[a][i];
num+=y[c][i-1]*x[a][i];
cout<<x[a][i]<<" "<<y[c][i-1]<<" "<<i<<endl;
}
return ans/num;
}
};