Submission #994275

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#define ll long long
#define INF (1000000000000)
#define NIL (-1)
using namespace std;

int main(){
  ios_base::sync_with_stdio(false);
  ll n, a;
  cin >> n >> a;
  ll size = 0;
  vector<ll> s(1100000,0);
  s[0] = 1;
  for(ll i = 1; i < 1100000; i++){
    ll cnt = 0;
    for(ll j = 1; j <= i-a; j++){
      if(s[i] > s[i-a-j] * j){
	cnt++;
      }
      if(cnt > 10)
	break;
      s[i] = max(s[i], s[i-a-j] * j);
    }
    if(s[i] > n){
      size = i;
      break;
    }
  }
  if(size == 0)
    size = 1100000;

  
  ll ans = 100000000000000;
  for(ll i = 0; i <= size; i++){
    if(s[i] != 0){
      ans = min(ans, i + (n+s[i]-1) / s[i]);
    }
  }
  cout << ans << endl;

}

Submission Info

Judge Result