Submission #5374700

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define REP(i,begin, n) for(int i=begin;i<n;i++)
typedef long long int lli;
typedef pair<int, int> P;

map<lli, lli> fac;

// dp[i][j][k][l]: i個目のサイコロを振った時点で2,3,5がそれぞれj,k,l個使われている確率
double dp[101][63][63][63];

int main() {
    int n;
    lli d;
    cin >> n >> d;

    while(d%2==0){
        d=d/2;
        fac[2]++;
    }
    while(d%3==0){
        d=d/3;
        fac[3]++;
    }
    while(d%5==0){
        d=d/5;
        fac[5]++;
    }
    if(d!=1){
        cout<<0<<endl;
        return 0;
    }

    dp[0][0][0][0] = 1.0;
    REP(i, 0, n) {
        REP(j, 0, 61) {
            REP(k, 0, 61) {
                REP(l, 0, 61) {
                    // 1
                    dp[i+1][j][k][l] += dp[i][j][k][l] * 1 / 6.0;

                    // 2
                    dp[i+1][j+1][k][l] += dp[i][j][k][l] * 1 / 6.0;

                    // 3
                    dp[i+1][j][k+1][l] += dp[i][j][k][l] * 1 / 6.0;

                    // 4
                    dp[i+1][j+2][k][l] += dp[i][j][k][l] * 1 / 6.0;

                    // 5
                    dp[i+1][j][k][l+1] += dp[i][j][k][l] * 1 / 6.0;

                    // 6
                    dp[i+1][j+1][k+1][l] += dp[i][j][k][l] * 1 / 6.0;
                    if (j == 60) {
                        // 2
                        dp[i+1][j+2][k][l] += dp[i][j+1][k][l] * 1 / 6.0;

                        // 6
                        dp[i+1][j+2][k+1][l] += dp[i][j+1][k][l] * 1 / 6.0;
                    }
                }
            }
        }
    }

    double ans = 0;
    REP(j, fac[2], 63) {
        REP(k, fac[3], 63) {
            REP(l, fac[5], 62) {
                ans += dp[n][j][k][l];
            }
        }
    }
    cout << ans << endl;
}

Submission Info

Judge Result