Submission #994489

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define PI       3.1415926535897932384626433832795028841971
#define INF      100000000
#define EPS      1e-10
#define MOD      1000000007
using namespace std;
typedef long long ll;
typedef pair<int,int> P;

ll n, a;
ll ans = INF;
ll t[1000001];

int main(){
    cin >> n >> a;
    for(int i = 0; i <= n; i++) t[i] = i;
    for(ll i = 2; i <= n/2; i++){
        ll tmp = t[i]+a;
        ll cnt = 0;
        for(ll j = i; j <= n*n+1; j += i){
            cnt++;
            bool end = false;
            if(j >= n){
                end = true;
                j = n;
            }
            if(t[j] > tmp+cnt){
                t[j] = tmp+cnt;
            }
            if(end) break;
        }
    }
    cout << t[n] << endl;
}

Submission Info

Judge Result