Submission #1046940

---

Source Code Expand

#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>

#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define all(v) begin(v), end(v)
#define debug(x) cerr<< #x <<": "<<x<<endl
#define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
typedef vector<vector<ll> > vvll;
template<class T> using vv=vector<vector< T > >;

ll po(ll x, ll n) {
  if (n == 0) {
    return 1;
  }
  ll x2 = po(x*x, n/2);
  if (n % 2 == 0) {
    return x2;
  } else {
    return x * x2;
  }
}

int main() {
  ll n, a;
  scanf("%lld %lld", &n, &a);
  vll ans(41, 0);
  ll ansmin = 1e15;
  rep (i, 41) {
    ll s = ceil(pow(n, (1.0 / (i+1))));
    ll maybig = po(s, i+1);
    int cnt = 0;
    while (true) {
      maybig = maybig / s * (s-1);
      if (maybig >= n) {
        cnt += 1;
      } else {
        break;
      }
    }
    ans[i] = a * i + s * (i+1) - cnt;
    ansmin = min(ansmin, ans[i]);
  }
  printf("%lld\n", ansmin);

  return 0;
}

Submission Info

Judge Result