Submission #993133

---

Source Code Expand

#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;

long long int AMAX = 2e6;

int main() {
	long long int N, A; cin >> N >> A;
	vector<long long int>dp(2e6 + 1);
	if (A <= 1e6) {
		for (long long int i = 0; i <= A; ++i) {
			dp[i] = i;

			if (dp[i] >= N) {
				cout << i << endl;
				return 0;
			}
		}
		for (long long int i = A + 1; i <= AMAX; ++i) {
			dp[i ] = dp[i-1] + 1;
			for (int j = 1; j <= i- A; ++j) {
				dp[i] = max(dp[i], dp[j] * dp[i - j - A]);
			}
			if (dp[i] >= N) {
				cout << i << endl;
				return 0;
			}
		}
	}
	
	return 0;
}

Submission Info

Judge Result