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.
The single line contains three integers r, s and p (1 ≤ r, s, p ≤ 100) — the original number of individuals in the species of rock, scissors and paper, respectively.
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.
2 2 2
0.333333333333 0.333333333333 0.333333333333
2 1 2
0.150000000000 0.300000000000 0.550000000000
1 1 3
0.057142857143 0.657142857143 0.285714285714
题意:有三种人,石头,剪刀,布,按照正常的规则定输赢,每次两个人相遇,问最终每种人占领岛屿的概率是多少
思路:三维dp,dp[i][j][k]表示剩余i石头,j剪刀,k布的概率是多少
那么如果石头和布相遇dp[i-1][j][k]=dp[i][j][k]*(i*k)/(i*k+i*j+j*k);
同理可推出其他两种情况
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int maxn=110;
double dp[maxn][maxn][maxn];
int a,b,c;
int main()
{
while(scanf("%d%d%d",&a,&b,&c)!=EOF)
{
memset(dp,0,sizeof(dp));
dp[a][b][c]=1;
for(int i=a;i>=0;i--)
{
for(int j=b;j>=0;j--)
{
for(int k=c;k>=0;k--)
{
if(!i&&!j||!i&&!k||!j&&!k)continue;
double cur=dp[i][j][k];
double tot=i*j+i*k+j*k;
if(i)dp[i-1][j][k]+=cur*double(i*k)/tot;
if(j)dp[i][j-1][k]+=cur*double(i*j)/tot;
if(k)dp[i][j][k-1]+=cur*double(j*k)/tot;
}
}
}
double ansa=0,ansb=0,ansc=0;
for(int i=1;i<=a;i++)ansa+=dp[i][0][0];
for(int i=1;i<=b;i++)ansb+=dp[0][i][0];
for(int i=1;i<=c;i++)ansc+=dp[0][0][i];
printf("%.9lf %.9lf %.9lf\n",ansa,ansb,ansc);
}
return 0;
}