zoj 3329 One Person Game 概率dp

One Person Game

---

Time Limit: 1 Second       Memory Limit: 32768 KB       Special Judge

---

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

1. Set the counter to 0 at first.
2. 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.
3. 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.

Input

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, K₁, K₂, K₃, a, b, c (0 <= n <= 500, 1 < K₁, K₂, K₃ <= 6, 1 <= a <= K₁, 1 <= b <= K₂, 1 <= c <= K₃).

Output

For each test case, output the answer in a single line. A relative error of 1e-8 will be accepted.

Sample Input

2
0 2 2 2 1 1 1
0 6 6 6 1 1 1

Sample Output

1.142857142857143
1.004651162790698

题意：有三个骰子，分别有Die1,Die2,Die3 个面，每掷一次骰子，若三个面分别为a，b，c，则计数器清零，否则计数器加上三个点数，当计数器大于n时结束，问结束时投掷骰子的期望。

思路：思路参考http://blog.csdn.net/morgan_xww/article/details/6775853，推得一手好公式，表示以前不知道还能这么求期望。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
using namespace std;
const int mod=1e9+7;
const int N=555;
double p[40],pa[N],pb[N];
int main(){
    int n,t,die1,die2,die3,a,b,c;
    scanf("%d",&t);
    while(t--){
        scanf("%d%d%d%d%d%d%d",&n,&die1,&die2,&die3,&a,&b,&c);
        memset(p,0,sizeof(p));
        memset(pa,0,sizeof(pa));
        memset(pb,0,sizeof(pb));
        int dd=die1+die2+die3;
        double pp=1.0/(die1*die2*die3);
        for(int i=1;i<=die1;i++){
            for(int j=1;j<=die2;j++){
                for(int k=1;k<=die3;k++){
                    if(i==a&&j==b&&k==c)continue;
                        p[i+j+k]+=pp;
                }
            }
        }
        for(int i=n;i>=0;i--){
            pa[i]=pp;
            pb[i]=1;
            for(int j=3;j<=dd;j++){
                pa[i]+=pa[i+j]*p[j];
                pb[i]+=pb[i+j]*p[j];
            }
        }
    printf("%.10lf\n",pb[0]/(1-pa[0]));
    }
    return 0;
}