Submission #1832284

---

Source Code Expand

# include <bits/stdc++.h>

# define pb push_back
# define fr first
# define sc second
# define mk make_pair
# define int long long

using namespace std;

const int inf = 1e9 + 7;
const int N = 2e6 + 5;

typedef long long ll;

int n, a, sum, dp[N], ans = inf;

main()
{
      cin >> n >> a;

      assert(n <= 1e6);

      dp[1] = 1;

      for(int i = 1; i <= n + 1000; i ++)
      {
            for(int j = i + i; j <= n + 1000; j += i)
            {
                  if(i > 1)
                  {
                        dp[j] = min(dp[j], dp[i] + a + j / i);
                  }
                  else
                        dp[j] = dp[j - i] + 1;
            }
      }

      for(int i = n; i <= n + 1000; i ++)
            ans = min(ans, dp[i]);

      cout << ans << endl;
}

Submission Info

Judge Result