Submission #5023802

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL n, a;
LL fp(LL a, LL b) {
    LL res = 1;
    for (; b; a = a * a, b >>= 1) {
        if (b & 1) res = a * res;
    }
    return res;
}
int main() {
    while (~scanf("%lld%lld", &n, &a)) {
        LL ans = n;
        for (int step = 1; (1LL << step) <= n; step++) {
            // cout << "current step " << step << endl;
            for (int pace = 2; fp(pace, step + 1) <= n; pace++) {
                LL x = pace * step, y = a * step, z = fp(pace, step);
                // cout << x << ',' << y << ',' << z << endl;
                ans = min(ans, x + y + (n + z - 1) / z);
                for (int i = 1; i <= step; i++) {
                    z /= pace;
                    z *= pace + 1;
                    ans = min(ans, x + i + y + (n + z - 1) / z);
                }
            }
        }
        cout << ans << endl;
    }
    return 0;
}

Submission Info

Judge Result