Submission #993680

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <sstream>

#include <vector>
#include <set>
#include <bitset>
#include <map>
#include <deque>
#include <string>

#include <algorithm>
#include <numeric>

#include <cstdio>
#include <cassert>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>

#define pb push_back
#define pbk pop_back
#define mp make_pair
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define foreach(i, a) for (__typeof((a).begin()) i = (a).begin(); i != (a).end(); ++i)
#define len(a) ((int) (a).size())

#ifdef CUTEBMAING
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif

using namespace std;

typedef long long int64;
typedef long double ld;
typedef unsigned long long lint;

const int inf = (1 << 30) - 1;
const int64 linf = (1ll << 62) - 1;
const int N = 1e6 + 100;

int64 n, a;
int64 dp[N];

int main() {
#ifdef XCODE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    cin >> n >> a;
    fill_n(dp, n + 1, linf);
    dp[1] = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 2; i * j <= n; j++) {
            dp[i * j] = min(dp[i * j], dp[i] + j + a);
        }
    }
    int64 ans = linf;
    for (int i = 1; i <= n; i++) {
        ans = min(ans, dp[i] + (n + i - 1) / i);
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result