Submission #5394639

---

Source Code Expand

#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
#define MAXN 100005
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template<class T>
void read(T &res) {
    res = 0;T f = 1;char c = getchar();
    while(c < '0' || c > '9') {
	if(c == '-') f = -1;
	c = getchar();
    }
    while(c >= '0' && c <= '9') {
	res = res * 10 +c - '0';
	c = getchar();
    }
    res *= f;
}
template<class T>
void out(T x) {
    if(x < 0) {x = -x;putchar('-');}
    if(x >= 10) {
	out(x / 10);
    }
    putchar('0' + x % 10);
}
int64 N,A;
map<int64,int64> zz;
int64 f(int64 x) {
    if(x == 1) return 0;
    if(zz.count(x)) return zz[x];
    int64 res = x + A;
    for(int64 i = 2 ; i <= x / i ; ++i) {
	if(x % i == 0) {
	    res = min(res,f(i) + (x / i - 1) + A);
	    int64 j = x / i;
	    if(j != i) {
		res = min(res,f(j) + (x / j - 1) + A);
	    }
	}
    }
    zz[x] = res;return res;
}
void Solve() {
    read(N);read(A);
    int64 ans = N;
    for(int64 i = 1 ; i <= N / i ; ++i) {
	if(N % i == 0) {
	    ans = min(ans,f(i) + (N / i));
	    int64 j = N / i;
	    if(j != i) ans = min(ans,f(j) + (N / j));
	}
    }
    out(ans);enter;
}
int main() {
#ifdef ivorysi
    freopen("f1.in","r",stdin);
#endif
    Solve();
    return 0;
}

Submission Info

Judge Result