Submission #993059

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<"("<<p.fs<<","<<p.sc<<")";}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<"sz = "<<vc.size()<<endl<<"[";for(const T& v:vc) o<<v<<",";o<<"]";return o;}
typedef long long ll;
double eps=1e-9;
ll inf=1e13;
void prod(ll& x,ll y){
	x*=y;
	if(x>=inf) x=inf;
}
int main(){
	ll N,A;
	cin>>N>>A;
	ll ans=N;
	rep1(i,40){
//		show(i);
		int xo=floor(pow(N,1.0/(i+1))-eps);
		if(xo<0) xo=0;
		for(ll x=xo;x<xo+2;x++){
			rep(a,i+1){
				ll pro=1;
				rep(b,a+1) prod(pro,x);
				rep(b,i-a) prod(pro,x+1);
//				show(x);
//				show(a+1);
//				show(pro);
				if(pro>=N){
					chmin(ans,i*A+x*(i+1)+i-a);
				}
			}
		}
	}
	cout<<ans<<endl;
}

Submission Info

Judge Result