Submission #1832733

---

Source Code Expand

#include <bits/stdc++.h>

#define fr first
#define sc second
#define mk make_pair

using namespace std;

long long n, k, ar[1000001];

bool ok(long long a, long long b)
{
    long long h = 1;
    for(int i = 1; i <= b; i++)
    {
        h = h * a;
        if(n <= h)
            return 1;
    }
    return 0;
}

int main()
{
    cin >> n >> k;
    long long ans = n;
    for(long long i = 1; i <= 40; i++)
    {
        long long x = i * k;
        long long l = 1, r = 1e6;
        while(r - l > 1)
        {
            long long mid = (r + l) / 2;
            if(ok(mid, i + 1))
                r = mid;
            else
                l = mid;
        }
        long long u = 1;
        for(int j = 1; j <= i + 1; j++)
            u *= l;

        x += (i + 1) * l;
        for(int j = 1; j <= i + 1; j ++)
        {
            u /= l;
            u *= r;
            x++;
            if(u >= n)
                break;
        }
        ans = min(ans, x);
    }

    cout << ans;
    return 0;
}

Submission Info

Judge Result