Submission #3677293

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll n,a,ans,T;
inline bool check(ll x,ll k)
{
    ll cnt=1;
    for(int i=0;i<=k;i++){
        cnt*=x;
        if(cnt>=n) return 1;
    }
    return 0;
}
int main()
{
    while(cin>>n>>a){
        ans=n;
        for(int i=1;i<=40;i++){
            ll l=1,r=(ll)1e9+1;
            while(l+1<r){
                ll mid=(l+r)>>1;
                if(check(mid,i)) r=mid;
                else l=mid;
            }
            ll u=1,x=a*i;
            for(int j=0;j<=i;j++) u*=(l);
            x+=(i+1)*(l);
            for(int j=0;j<=i;j++){
                u/=(l); u*=r;
                x++;
                if(u>=n) break;
            }
            ans=min(ans,x);
        }
        cout<<ans<<endl;
    }
}

Submission Info

Judge Result