Submission #995743

---

Source Code Expand

// Standard I/O
#include <iostream>
#include <sstream>
#include <cstdio>
// Standard Library
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
// Template Class
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
// Container Control
#include <algorithm>

using namespace std;

#define rep( i, n ) for( int i = 0; i < n; ++i )
#define irep( i, n ) for( int i = n-1; i >= 0; --i )
#define reep( i, s, n ) for ( int i = s; i < n; ++i )
#define ireep( i, n, s ) for ( int i = n-1; i >= s; --i )
#define foreach(itr, x) for( typeof(x.begin()) itr = x.begin(); itr != x.end(); ++itr)

#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define all( v ) v.begin(), v.end()
#define fs first
#define sc second
#define vc vector

// for visualizer.html
double SCALE = 1.0;
double OFFSET_X = 0.0;
double OFFSET_Y = 0.0;
#define LINE(x,y,a,b) cerr << "line(" << SCALE*(x) + OFFSET_X << ","	\
	<< SCALE*(y) + OFFSET_Y << ","										\
	<< SCALE*(a) + OFFSET_X << ","										\
	<< SCALE*(b) + OFFSET_Y << ")" << endl;
#define CIRCLE(x,y,r) cerr << "circle(" << SCALE*(x) + OFFSET_X << ","	\
	<< SCALE*(y) + OFFSET_Y << ","										\
	<< SCALE*(r) << ")" << endl;

typedef long long ll;
typedef complex<double> Point;

typedef pair<int, int> pii;
typedef pair<int, pii> ipii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector< vector<int> > vii;
typedef vector< vector<double> > vdd;

typedef vector<int>::iterator vi_itr;

const int IINF = 1 << 28;
const double INF = 1e30;
const double EPS = 1e-10;
const double PI = acos(-1.0);

// Direction : L U R D
const int dx[] = { -1, 0, 1, 0};
const int dy[] = { 0, -1, 0, 1 };

ll N, A;
ll solve ( int eat_num )
{
	ll l = 0, r = pow(N+1, 1.0/eat_num)*1.1;
	while( r - l > 1 ){
		ll mid = (l+r)/2;
		
		ll tmp = 1;
		rep(i, eat_num+1) if( tmp < N ) tmp *= mid;
		
		if( tmp >= N ) r = mid;
		else l = mid;
	}

	ll m = l+1;
	int num = 0;
	rep(i, eat_num+1){
		ll tmp = 1;
		rep(j, i) if( tmp < N ) tmp *= m-1;
		reep(j, i, eat_num+1) if( tmp < N ) tmp *= m;

		if( tmp >= N ){
			num = i;
		}
	}

	ll y = 1, z = 0;
	rep(i, eat_num+1){
		if( i < num ){
			z += m-1;
		}
		else{
			z += m;
		}
	}

	return eat_num*A + z;
}

int main()
{
	cin >> N >> A;

	ll ans = N;
	reep(i, 1, 50){
		ll tmp = solve(i);
		ans = min(ans,tmp);
	}
	cout << ans << endl;
}

Submission Info

Judge Result