Submission #1301861

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;
long long N, A;
int main() {
	cin >> N >> A;
	long long ret = N;
	for (int i = 2; i <= 40; i++) {
		bool flag = false;
		for (int j = 1; !flag; j++) {
			for (int k = i; k >= 1; k--) {
				long long mul = 1;
				for (int l = 0; l < k; l++) mul *= j;
				for (int l = k; l < i; l++) mul *= j + 1;
				if (mul >= N) {
					ret = min(ret, i * (j + 1) - k + 1LL * A * (i - 1));
					flag = true; break;
				}
			}
		}
	}
	cout << ret << endl;
	return 0;
}

Submission Info

Judge Result