Submission #18354165

---

Source Code Expand

 //
#include<bits/stdc++.h>

using namespace std;

#define PB push_back
#define f first
#define s second
#define what_is(x) cerr << #x << " is " << x << endl;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

const int INF = 1000000007;
const ll MOD = 1000000007;

void solve_test()
{
    int a, b, c;
    cin >> a >> b >> c;

    double p[102][102][102];
    memset(p, 0, sizeof(p));
    p[a][b][c]=1;
    for(int i=a; i<100; i++)
    {
        for(int j=b; j<100; j++)
        {
            for(int k=c; k<100; k++)
            {
                double ip = double(i)/(i+j+k);
                double jp = double(j)/(i+j+k);
                double kp = double(k)/(i+j+k);

                p[i+1][j][k] += p[i][j][k] * ip;
                p[i][j+1][k] += p[i][j][k] * jp;
                p[i][j][k+1] += p[i][j][k] * kp;
            }
        }
    }
    double ans = 0;
    for(int i=0; i<=100; i++)
    {
        for(int j=0; j<=100; j++)
        {
            for(int k=0; k<=100; k++)
            {
                int ct = (i==100) + (j==100) + (k==100);
                if(ct == 1)
                {
                    ans += p[i][j][k] * (i+j+k-a-b-c);
                }
            }
        }
    }
    cout << setprecision(20) << ans;
}

signed main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    int tests;
    tests = 1;
    //cin >> tests;
    while(tests--)
    {
        solve_test();
    }
    return 0;
}

Submission Info

Judge Result