Submission #993494

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long LL;

#define MAX_N 1000005
#define LL_MAX 1145141919810364

LL N, A;
void input()
{
  cin >> N >> A;
}

LL dp[MAX_N];

//持ちクッキー0枚からn枚以上焼き上げるのにかかる最小時間
LL solve(LL n)
{
  if(dp[n] >= 0){
    return dp[n];
  }
  if(n == 1){
    return dp[n] = 1;
  }

  LL ret = n;
  bool flag = true;
  for (int i = 2; flag; i++) {
    LL k = n/i;
    if(k*i < n){
      k++;
    }
    LL tmp = solve(k) + A + i;
    ret = min(tmp, ret);
    if(n/i == 0){
      break;
    }
  }

  return dp[n] = ret;
}

int main()
{
  input();

  if(N > 1000000){
    return 0;
  }

  memset(dp, -1, sizeof(dp));

  cout << solve(N) << endl;

  return 0;
}

Submission Info

Judge Result