Problem:
Score : 1000 points

Problem Statement

Rng is baking cookies.

Initially, he can bake one cookie per second.

He can also eat the cookies baked by himself.
When there are x cookies not yet eaten, he can choose to eat all those cookies. After he finishes eating those cookies, the number of cookies he can bake per second becomes x. Note that a cookie always needs to be baked for 1 second, that is, he cannot bake a cookie in 1/x seconds when x > 1.
When he choose to eat the cookies, he must eat all of them; he cannot choose to eat only part of them.
It takes him A seconds to eat the cookies regardless of how many, during which no cookies can be baked.

He wants to give N cookies to Grandma.
Find the shortest time needed to produce at least N cookies not yet eaten.

Constraints

1≦N≦10^{12}

0≦A≦10^{12}

A is an integer.

Partial Score

500 points will be awarded for passing the test set satisfying N≦10^6 and A≦10^6.

Additional 500 points will be awarded for passing the test set without additional constraints.

Input

The input is given from Standard Input in the following format:

N A

Output

Print the shortest time needed to produce at least N cookies not yet eaten.

Sample Input 1

8 1

Sample Output 1

7

It is possible to produce 8 cookies in 7 seconds, as follows:

After 1 second: 1 cookie is done.

After 2 seconds: 1 more cookie is done, totaling 2. Now, Rng starts eating those 2 cookies.

After 3 seconds: He finishes eating the cookies, and he can now bake 2 cookies per second.

After 4 seconds: 2 cookies are done.

After 5 seconds: 2 more cookies are done, totaling 4.

After 6 seconds: 2 more cookies are done, totaling 6.

After 7 seconds: 2 more cookies are done, totaling 8.

Sample Input 2

1000000000000 1000000000000

Sample Output 2

1000000000000

Solution in C++14 (GCC 5.4.1) (judge verdict: Time Limit Exceeded)

#include <vector>
#include <queue>
#include <unordered_map>
#include <tuple>
#include <cstdio>
using namespace std;

namespace std{
	template<typename T>
	inline void hash_combine(size_t& seed, T const& v){
		seed ^= hash<T>()(v) + 0x9e3779b9 + (seed<<6) + (seed>>2);
	}
	template<typename A,typename B>
	class hash<pair<A,B>>{
		public:
		size_t operator()(pair<A,B> const &p) const{
			size_t seed=0;
			hash_combine(seed,p.first);
			hash_combine(seed,p.second);
			return seed;
		}
	};
}
 
int main(){
	long long N,A,R;
	scanf("%lld%lld",&N,&A);R=N;
	if(N>1000000)return 1;
 
	unordered_map<pair<long long,long long>,long long>m; //m<n,speed>=time
	m[{0,1}]=0;
	queue<tuple<long long,long long,long long> >q;
	q.push(make_tuple(0,1,0));
	for(;!q.empty();){
		auto cur=q.front();q.pop();
		long long n=get<0>(cur);
		long long speed=get<1>(cur);
		long long time=get<2>(cur);
		if(time>=R)continue;
 
		vector<tuple<int,int,int>> nxt={
			make_tuple(0,n,time+A),
			make_tuple(n+speed,speed,time+1)
		};
		for(auto &e:nxt){
			long long nxtn=get<0>(e);
			long long nxtspeed=get<1>(e);
			long long nxttime=get<2>(e);
			if(nxtn>=N){
				R=min(R,nxttime);
			}else if(m.find({nxtn,nxtspeed})==m.end()||m[{nxtn,nxtspeed}]>nxttime){
				m[{nxtn,nxtspeed}]=nxttime;
				q.push(e);
			}
		}
	}
	printf("%lld\n",R);
}