Submission #5892664

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
int main(){
	long long n, a, ans;
	cin >> n >> a;
	ans = n;
	for(int i = 2; i <= 50; i++){
		for(int root = 2; ; root++){
			long long p = 1;
			for(int j = 0; j < i; j++) p *= root;
			if(p >= n){
				long long sum = (root - 1) * i;
				p = 1;
				for(int j = 0; j < i; j++) p *= root - 1;
				while(p < n){
					p /= root - 1;
					p *= root;
					sum += 1;
				}
				ans = min(ans, sum + a * (i - 1));
				break;
			}
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result