Submission #994698

---

Source Code Expand

#include <climits>
#include <iostream>
using namespace std;

int main(void)
{
    long long int N, A;
    cin >> N >> A;

    long long int dp[40];
    dp[0] = 0;

    for (long long int i = 1; i < 40; i++) {
        dp[i] = LONG_MAX;
        for (int j = 0; j < i; j++)
            dp[i] = min(dp[i], dp[j] + (1L << (i - j)) + A);
        //cout << i << " " << dp[i] << endl;
    }

    long long int res = LONG_MAX, cnt;
    for (long long int i = 0; i < 40; i++) {
        cnt = dp[i] + N / (1L << i);
        if (N % (1 << i))
            cnt++;
        //cout << i << " " << cnt << endl;
        res = min(res, cnt);
    }

    cout << res << endl;
    return 0;
}

Submission Info

Judge Result