Submission #1757321

---

Source Code Expand

#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout<<" "<<kbrni;cout<<endl
#define smap(m) cout<<#m<<":";each(kbrni,m)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 100005;

ll n,a;

bool possible(ll val,int cnt,int al)
{
	ll num = 1;
	rep(i,cnt){
		num *= val;
	}
	rep(i,al-cnt){
		num *= (val+1);
	}
	if(num >= n){
		return true;
	}else{
		return false;
	}
}

void out(ll val,int cnt,int al)
{
	ll num = 1;
	rep(i,cnt){
		num *= val;
	}
	rep(i,al-cnt){
		num *= (val+1);
	}
	show(num);
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n >> a;
	vl vec;
	srep(i,1,100){
		ll hoge = floor(pow(n,(double)1/i));
		rrep(j,i+1){
			if(possible(hoge,j,i)){
				vec.pb(hoge*i+i-j+a*(i-1));
				break;
			}
		}
	}
	sort(all(vec));
	cout << vec[0] << "\n";
	return 0;
}

Submission Info

Judge Result