Submission #1832434

---

Source Code Expand

#include <iostream>
#include <vector>
#include <deque>
#include <math.h>
#include <set>
#include <iomanip>
#include <time.h>
#include <list>
#include <stdio.h>
#include <queue>
#include <map>
#include <algorithm>
#include <assert.h>
#include <memory.h>

#define mk make_pair
#define sc second
#define fr first
#define pb emplace_back
#define sz(s) ( (int)s.size() )
#define all(s) s.begin(), s.end()

using namespace std;

const int N = 2e6;

int n, a, r = 1e5, mp[N];

inline int min(int a, int b)
{
    return a < b ? a : b;
}

int f (int x)
{
    if(mp[x])
        return mp[x];

    int ans = x;

    for (int j = 2; j * j <= x; j++)
    {
        if (x % j == 0)
        {
            ans = min( ans, f(x / j) + j + a );
            ans = min( ans, f(j) + x / j + a );
        }
    }
    mp[x] = ans;
    return ans;
}

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

    r = 1;
    while (r < n)
        r <<= 1;

    cout << f(r) << endl;
}

Submission Info

Judge Result