Submission #1001817

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
 
const long long MOD = 1000000007;
const int INF = 1<<29;
const double EPS = 1e-8;
typedef vector<int> vec;
typedef pair<int,int> P;
typedef long long ll;

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

    ll eat_max = 1;
    while((1LL<<eat_max) < N) eat_max++;

    ll ans = N;
    for(ll eat=1;eat<eat_max;eat++){
        ll max_term = 2;
        while(1){
            ll score = eat * A + max_term + eat * (max_term - 1);

            // prod <- max_term * (max_term-1)^eat
            ll prod = max_term;
            for(ll i=0;i<eat;i++){
                prod *= max_term - 1;
            }

            for(ll i=0;i<eat && prod<N;i++){
                prod /= max_term - 1;
                prod *= max_term;
                score++;
            }

            if(N <= prod){
                ans = min(ans, score);
                break;
            }
            max_term++;
        }
    }

    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result