Submission #994842

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <functional>
#include <utility>
#include <queue>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef long long int ll;
const ll  MOD = 1000000007;
typedef pair<ll,ll> P;

ll N,A;
vector<P> v;
ll dp[2002002];
int main(){
  cin >> N >> A;
  dp[0] = 0;
  ll t;
  for(ll i=1;i<=2*N;i++){
    dp[i] = i;
  }
  for(ll i=2;i<=2*N;i++){
    t = dp[i] + A;
    for(ll j=i;j<=2*N;j+=i){
      dp[j] = min(dp[j],t + (j/i));
    }
  }
  ll ans = 100100100100100100;
  for(ll i=N;i<=2*N;i++){
    if(ans > dp[i]) ans = dp[i];
  }
  cout << ans << endl;
}

Submission Info

Judge Result