Submission #993661

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef pair<ll,ll> P;
const int INF=INT_MAX / 3;
const ll LINF=LLONG_MAX / 3LL;
#define CONST 1000000007
#define EPS (1e-8)
#define PB push_back
#define MP make_pair
#define sz(a) ((int)(a).size())
#define reps(i,n,m) for(int i=(n);i<int(m);i++)
#define rep(i,n) reps(i,0,n)
#define SORT(a) sort((a).begin(),(a).end())
ll mod(ll a,ll m){return (a%m+m)%m;}
int dx[9]={0,1,0,-1,1,1,-1,-1,0},dy[9]={1,0,-1,0,1,-1,1,-1,0};
ll n,m,a;
ll f(ll ini, ll tar){
  ll r = tar / ini;
  if(r * ini < tar) r++;
  printf("f(%lld, %lld)=%lld", ini, tar, ini+r);
  return ini+r;
}
int main(){
  cin>>n>>a;
  ll c=1;
  ll ans = n;
  assert(n <= 2000000 && a <= 2000000);
  while(a * c < ans) {
    vector<int> vec;
    ll b = n;
    vec.PB(b);
    rep(i,c){
      b = sqrt(b);
      vec.PB(b);
    }
    reverse(vec.begin(), vec.end());
    ll v = 1;
    ll acc=0;
    for(auto x: vec) {
      //cerr<<" "<<x;
      acc += x/v;
      if((x/v)*v != x) acc+=1;
      if(x!=n)acc += a;
      v = x;
    }
    //cerr<<endl;
    ans = min(ans, acc);
    //cerr<<ans<<endl;
    c++;
  }
  return 0;
}

Submission Info

Judge Result