Submission #3212705

---

Source Code Expand

#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
  ll n, a;
  cin>>n>>a;
  if(n==1){
    cout<<1<<endl;
    return 0;
  }
  ll ans=n;
  ll m=(ll)(log((double)n)/log(2.0));
  for(ll k=2; k<=m+1; k++){
    ll ans1=(k-1)*a;
    ll t=(ll)pow((double)n, 1.0/(double)k);
    ll x1=0, x2=k;
    while(x1!=x2){
      ll x=(x1+x2+1)/2;
      if(pow((double)t, (double)x)*pow((double)(t+1), (double)(k-x))>=(double)n){
        x1=x;
      }else{
        x2=x-1;
      }
    }
    ans1+=(t*x1+(t+1)*(k-x1));
    ans=min(ans, ans1);
  }
	cout<<ans<<endl;
	return 0;
}

Submission Info

Judge Result