原题:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3329
题意:
有三个色子,分别有k1,k2,k3面,点数为1到k;
每次掷色子,若点数分别为a,b,c时则将分数清零,否则加上三个点数和;
当分数>n时,游戏结束,问需要掷色子次数的期望;
思路:
dp[i]表示当分数为i时到游戏结束所需掷色子次数的期望,显然dp[i>n] = 0,dp[0]即为所求答案;
动态方程为dp[i] = ∑Pk*dp[i+k]+P0*dp[0]+1(Pk表示点数和为k时的概率,P0表示清零的概率)
设dp[i] = a[i]*dp[0]+b[i],代入上一个式子,得:dp[i] =(∑Pk*a[i+k]+P0)*dp[0]+∑Pk*b[i+k]+1;
所以a[i] = ∑Pk*a[i+k]+P0, b[i] = ∑Pk*b[i+k]+1;
当i>n时,dp[i] = a[i]*dp[0]+b[i] = 0,所以a[i>n] = b[i>n] = 0;
则dp[0] = b[0]/(1-a[0]);
#include<stdio.h>
#include<string.h>
int n, k1, k2, k3, x, y, z;
double a[600], b[600], p[20];
int main()
{
int cas;
scanf("%d", &cas);
while(cas--)
{
scanf("%d%d%d%d%d%d%d", &n, &k1, &k2, &k3, &x, &y, &z);
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
memset(p, 0, sizeof(p));
double p0 = 1.0/(k1*k2*k3);
for(int k = 1;k<=k1;k++)
{
for(int i = 1;i<=k2;i++)
{
for(int j = 1;j<=k3;j++)
{
if(k!=x || i!=y || j!=z)
p[k+i+j]+=p0;
}
}
}
for(int i = n;i>=0;i--)
{
for(int j = 3;j<=(k1+k2+k3);j++)
{
a[i]+=p[j]*a[i+j];
b[i]+=p[j]*b[i+j];
}
a[i]+=p0;
b[i]+=1;
}
printf("%.15f\n", b[0]/(1-a[0]));
}
return 0;
}