# CodeForces 540D Bad Luck Island （概率dp）

257人阅读 评论(0)

The Bad Luck Island is inhabited by three kinds of species: r rocks, s scissors and p papers. At some moments of time two random individuals meet (all pairs of individuals can meet equiprobably), and if they belong to different species, then one individual kills the other one: a rock kills scissors, scissors kill paper, and paper kills a rock. Your task is to determine for each species what is the probability that this species will be the only one to inhabit this island after a long enough period of time.

Input

The single line contains three integers rs and p (1 ≤ r, s, p ≤ 100) — the original number of individuals in the species of rock, scissors and paper, respectively.

Output

Print three space-separated real numbers: the probabilities, at which the rocks, the scissors and the paper will be the only surviving species, respectively. The answer will be considered correct if the relative or absolute error of each number doesn't exceed 10 - 9.

Sample test(s)
input
2 2 2

output
0.333333333333 0.333333333333 0.333333333333

input
2 1 2

output
0.150000000000 0.300000000000 0.550000000000

input
1 1 3

output
0.057142857143 0.657142857143 0.285714285714


#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <limits>
#include <queue>
#include <stack>
#include <vector>
#include <map>

using namespace std;
typedef  long long LL;

#define N 110
#define INF 0x3f3f3f3f
#define PI acos (-1.0)
#define EPS 1e-8
#define met(a, b) memset (a, b, sizeof (a))

double dp[N][N][N];

int main ()
{
int r, s, p;

while (scanf ("%d %d %d", &r, &s, &p) != EOF)
{
met (dp, 0);

dp[r][s][p] = 1.0;

for (int i=r; i>=1; i--)
for (int j=s; j>=1; j--)
for (int k=p; k>=1; k--)
{
double sum = i*j + j*k + i*k;

dp[i-1][j][k] += dp[i][j][k] * i*k*1.0/sum;
dp[i][j-1][k] += dp[i][j][k] * j*i*1.0/sum;
dp[i][j][k-1] += dp[i][j][k] * k*j*1.0/sum;
}

double ans1 = 0, ans2 = 0, ans3 = 0;

for (int i=1; i<=100; i++)
for (int j=0; j<=100; j++)
{
ans1 += dp[i][j][0];
ans2 += dp[0][i][j];
ans3 += dp[j][0][i];
}

printf ("%.10f %.10f %.10f\n", ans1, ans2, ans3);
}
return 0;
}


个人资料
等级：
访问量： 8万+
积分： 3584
排名： 1万+
最新评论