提出 #52616739

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <iomanip>
#define ll long long
#define ull unsigned long long
#define pa first
#define pb second
#define endl '\n'
#define vint vector<int>
#define vlong vector<ll>
#define pii pair<int, int>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rng(i, a, b) for (int i = int(a); i <= int(b); i++)
#define per(i, a, b) for (int i = int(b - 1); i >= int(a); i--)
#define gnr(i, a, b) for (int i = int(b); i >= int(a); i--)
using namespace std;
#define ATC
#ifdef ATC
#include <atcoder/all>
using namespace atcoder;
#endif

#ifdef MT
void solve()
{
}
#endif
ll N, a, x, y;

map<ll, double> dp;

double dfs(ll n)
{
    if (n == 0)
        return 0;
    if (dp.count(n))
        return dp[n];
    else
        return dp[n] = min(dfs(n / a) + x, 1.0 / 5.0 * (dfs(n / 2) + dfs(n / 3) + dfs(n / 4) + dfs(n / 5) + dfs(n / 6)) + 6.0 / 5.0 * y);
}

int main(void)
{
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> N >> a >> x >> y;
    cout << fixed << setprecision(10) << dfs(N) << endl;

#ifdef MT
    int t;
    cin >> t;
    for (int i = 0; i < t; i++)
        solve();
#endif
}

提出情報

ジャッジ結果