# 题目

{% fold 点击显/隐题目 %}

There is a very simple and interesting one-person game. You have 3 dice, namely Die1, Die2 and Die3. Die1 has K1 faces. Die2 has K2 faces. Die3 has K3 faces. All the dice are fair dice, so the probability of rolling each value, 1 to K1, K2, K3 is exactly 1 / K1, 1 / K2 and 1 / K3. You have a counter, and the game is played as follow:

Set the counter to 0 at first.
Roll the 3 dice simultaneously. If the up-facing number of Die1 is a, the up-facing number of Die2 is b and the up-facing number of Die3 is c, set the counter to 0. Otherwise, add the counter by the total value of the 3 up-facing numbers.
If the counter's number is still not greater than n, go to step 2. Otherwise the game is ended.

Calculate the expectation of the number of times that you cast dice before the end of the game.

There are multiple test cases. The first line of input is an integer T (0 < T <= 300) indicating the number of test cases. Then T test cases follow. Each test case is a line contains 7 non-negative integers n, K1, K2, K3, a, b, c (0 <= n <= 500, 1 < K1, K2, K3 <= 6, 1 <= a <= K1, 1 <= b <= K2, 1 <= c <= K3).
For each test case, output the answer in a single line. A relative error of 1e-8 will be accepted.
2 0 2 2 2 1 1 1 0 6 6 6 1 1 1
1.142857142857143 1.004651162790698
{% endfold %}

# 题解

{% raw %}\begin{align*} dp[i] &= \sum (dp[i+j] \times p[j]) + dp[0] \times p[0] \ 设: dp[i] &= A[i] \times dp[0] + B[i] \ 带入原式得: dp[i] &= \sum((A[i+j] \times dp[0] + B[i+j) \times p[j]) + dp[0] \times p[0] \ 整理得: dp[i] &=\sum ((p[j]*A[i+j]) + p[0]) \times dp[0]) + \sum(p[j] \times B[i+j]) + 1 \ \ \therefore A[i] &= \sum(p[j] \times A[i+j]) + p[0] \ B[i] &= \sum (p[j] \times B[i+j]) + 1 \ \ 且: dp[0] &= \frac{B[0]}{1-A[0]} \ A[i] &= B[i] = 0,i>n \end{align*}{% endraw %}

# 代码

{% fold 点击显/隐代码 %}cpp One Person Game https://github.com/OhYee/sourcecode/tree/master/ACM 代码备份
#include
#include
using namespace std;

#define Log(format, ...) //printf(format, ##VA_ARGS)

const int maxk = 3;
const int maxnum = 20;
const int maxn = 550;

int n, k[maxk], a[maxk];
double A[maxn], B[maxn], p[maxnum];

int main() {
int T;
scanf("%d", &T);
while (T--) {
scanf("%d%d%d%d%d%d%d", &n, &k[0], &k[1], &k[2], &a[0], &a[1], &a[2]);

    memset(p, 0, sizeof(p));
for (int i = 1; i <= k[0]; ++i)
for (int j = 1; j <= k[1]; ++j)
for (int l = 1; l <= k[2]; ++l) {
if (i == a[0] && j == a[1] && l == a[2]) {
p[0] += 1;
} else {
p[i + j + l] += 1;
}
}

int sum = k[0] * k[1] * k[2];
for (int i = 0; i < maxnum; ++i) {
p[i] = p[i] / sum;
Log("%d %f\n", i, p[i]);
}

memset(A, 0, sizeof(A));
memset(B, 0, sizeof(B));
for (int i = n; i >= 0; --i) {
for (int j = 3; j < maxnum; ++j) {
Log("%d %d %f %f %f\n", i,j, p[j],A[i+j],B[i+j]);
A[i] += p[j] * A[i + j];
B[i] += p[j] * B[i + j];
}
Log("%d %f %f\n", i, A[i],B[i]);
A[i] += p[0];
B[i] += 1;
Log("%d %f %f\n", i, A[i],B[i]);
}

printf("%.15f\n", B[0] / (1 - A[0]));
}
return 0;


}

{% endfold %}`