Submission #5018790

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

using int64 = long long;
int64 n, m;

int64 dfs(int64 cur) {
	if (cur <= 3)
		return cur;
	int64 base = sqrt(cur), ans = cur;
	for (int64 a = base; a <= base + 1; a++) {
		int64 b = (cur + a - 1) / a;
		ans = min(ans, dfs(a) + dfs(b) + m);
	}
	return ans;
}

int main() {
	cin >> n >> m;
	cout << dfs(n) << endl;
	return 0;
}

Submission Info

Judge Result