Language: C++

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

void chmin(ll &a, ll b) {
	a = min(a, b);
}
void chmax(ll &a, ll b) {
	a = max(a, b);
}
ll mod_pow(ll a, ll n, ll m = mod) {
	a %= m;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

int dx[6] = { 1,0,-1,1,-1,0 };
int dy[6] = { 1,1,1,0,0,-1 };


ll a, b, c, d;

map<ll, bool> used;
map<ll, ll>memo;
ll calc(ll n) {
	if (n == 0)return 0;
	if (used[n])return memo[n];
	used[n] = true;
	ll x1, x2, y1, y2, z1, z2;
	x1 = x2 = y1 = y2 = z1 = z2 = INF;
	x1 = calc(n / 2) + a + d * (n % 2);
	if(n/2+1<n)x2 = calc(n / 2 + 1) + a + d * (2 - n % 2);
	
	ll y1 = calc(n / 3) + b + d * (n % 3);
	ll y2 = calc(n / 3 + 1) + b + d * (3 - n % 3);
	ll z1 = calc(n / 5) + c + d * (n % 5);
	ll z2 = calc(n / 5 + 1) + c + d * (5 - n % 5);
	ll res = min({ x1,x2,y1,y2,z1,z2 });
	if (INF / d >= n) {
		res = min(res, d*n);
	}
	return memo[n] = res;
}

void solve(){
	used.clear();
	memo.clear();

	ll n; cin >> n >> a >> b >> c >> d;
	cout << calc(n) << "\n"; return;

	
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	int t; cin >> t;rep(i, t)solve();
	//solve();
	stop
		return 0;
}


Compiler output:
a.cc: In function 'll calc(ll)':
a.cc:122:12: error: redeclaration of 'll y1'
  122 |         ll y1 = calc(n / 3) + b + d * (n % 3);
      |            ^~
a.cc:117:20: note: 'll y1' previously declared here
  117 |         ll x1, x2, y1, y2, z1, z2;
      |                    ^~
a.cc:123:12: error: redeclaration of 'll y2'
  123 |         ll y2 = calc(n / 3 + 1) + b + d * (3 - n % 3);
      |            ^~
a.cc:117:24: note: 'll y2' previously declared here
  117 |         ll x1, x2, y1, y2, z1, z2;
      |                        ^~
a.cc:124:12: error: redeclaration of 'll z1'
  124 |         ll z1 = calc(n / 5) + c + d * (n % 5);
      |            ^~
a.cc:117:28: note: 'll z1' previously declared here
  117 |         ll x1, x2, y1, y2, z1, z2;
      |                            ^~
a.cc:125:12: error: redeclaration of 'll z2'
  125 |         ll z2 = calc(n / 5 + 1) + c + d * (5 - n % 5);
      |            ^~
a.cc:117:32: note: 'll z2' previously declared here
  117 |         ll x1, x2, y1, y2, z1, z2;
      |                                ^~