Submission #5630127

---

Source Code Expand

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

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<int, pii> pipii;
typedef vector<vector<int> > mati;
typedef vector<vector<double> > matd;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef vector<pll> vpll;

#define FOR(i,x,y) for(ll i=(ll)x; i<(ll)y; ++i)
#define REP(i,y) FOR(i, 0, y)
#define RFOR(i,x,y) for(ll i=(ll)x; i>=(ll)y; --i)
#define RREP(i,x) RFOR(i, x, 0)
#define ALL(a) a.begin(), a.end()
#define pb push_back

inline void IN(void){
  return;
}

template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){
  cin >> first;
  IN(rest...);
  return;
}

inline void OUT(void){
  cout << "\n";
  return;
}

template <typename First, typename... Rest>
void OUT(First first, Rest... rest){
  cout << first << " ";
  OUT(rest...);
  return;
}

template <typename T>
void vec_print(vector<T> VEC){
  REP(i, VEC.size()){
    cout << VEC[i] << " ";
  }
  cout << "\n";
};

template <typename T>
void mat_print(vector<vector<T> > MAT){
  REP(i, MAT.size()){
    REP(j, MAT[i].size()){
      cout << MAT[i][j] << " ";
    }
    cout << "\n";
  }
};

template <typename CLASS1, typename CLASS2>
class HOGE{
  public:
    CLASS1 key;
    CLASS2 value;
    HOGE(void){
      return;
    };
    HOGE(CLASS1 key, CLASS2 value){
      this->key = key;
      this->value = value;
    };
    ~HOGE(void){
      return;
    };

    void print(void){
      cout << "key : " << key << ", value : " << value << "\n";
      return;
    };
    
    bool operator==(const HOGE &obj){
      return (this->value == obj.value);
    };
    bool operator<(const HOGE &obj){
      return (this->value < obj.value);
    };
    bool operator>(const HOGE &obj){
      return (this->value > obj.value);
    };
};

template <typename CLASS1, typename CLASS2>
bool operator==(const HOGE<CLASS1, CLASS2> &hoge1, const HOGE<CLASS1, CLASS2> &hoge2){
  return hoge1.value == hoge2.value;
};

template <typename CLASS1, typename CLASS2>
bool operator<(const HOGE<CLASS1, CLASS2> &hoge1, const HOGE<CLASS1, CLASS2> &hoge2){
  return hoge1.value < hoge2.value;
};

template <typename CLASS1, typename CLASS2>
bool operator>(const HOGE<CLASS1, CLASS2> &hoge1, const HOGE<CLASS1, CLASS2> &hoge2){
  return hoge1.value > hoge2.value;
};

constexpr int INF = (1<<30);
constexpr ll INFLL = 1LL<<62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9)+7);

vector<vector<vector<double>>> dp;

int main(){
  cin.tie(0); // cut the cin and cout (default, std::flush is performed after std::cin)
  ios::sync_with_stdio(false); // cut the iostream and stdio (DON'T endl; BUT "\n";)

  ll N,D;
  IN(N,D);

  ll two=0, three=0, five=0;
  ll D_copy = D;
  while(D_copy%2==0){
    D_copy/=2;
    two++;
  }
  while(D_copy%3==0){
    D_copy/=3;
    three++;
  }
  while(D_copy%5==0){
    D_copy/=5;
    five++;
  }

  if(D_copy!=1){
    printf("%.12lf\n", 0.0);
    return 0;
  }

  dp.resize(two+1, vector<vector<double>>(three+1, vector<double>(five+1, 0.0)));
  dp[0][0][0] = 1.0;
  REP(n,N){
    vector<vector<vector<double>>> dp_copy = dp;
    dp.assign(two+1, vector<vector<double>>(three+1, vector<double>(five+1, 0.0)));

    REP(i,two+1) REP(j,three+1) REP(k, five+1){
      dp[i][j][k] += dp_copy[i][j][k]/6.0;
      if(i<two)
        dp[i+1][j][k] += dp_copy[i][j][k]/6.0;
      else
        dp[i][j][k] += dp_copy[i][j][k]/6.0;
      if(j<three)
        dp[i][j+1][k] += dp_copy[i][j][k]/6.0;
      else
        dp[i][j][k] += dp_copy[i][j][k]/6.0;
      if(i<two-1)
        dp[i+2][j][k] += dp_copy[i][j][k]/6.0;
      else
        dp[two][j][k] += dp_copy[i][j][k]/6.0;
      if(k<five)
        dp[i][j][k+1] += dp_copy[i][j][k]/6.0;
      else
        dp[i][j][k] += dp_copy[i][j][k]/6.0;
      if(i<two && j<three)
        dp[i+1][j+1][k] += dp_copy[i][j][k]/6.0;
      else if(i<two)
        dp[i+1][j][k] += dp_copy[i][j][k]/6.0;
      else if(j<three)
        dp[i][j+1][k] += dp_copy[i][j][k]/6.0;
      else
        dp[i][j][k] += dp_copy[i][j][k]/6.0;
    }
  }

  double ans = dp[two][three][five];

  printf("%.12lf\n", ans);

  return 0;
}

Submission Info

Judge Result