Language: C++

#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
#define present(t, x) (t.find(x) != t.end())
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define prec(n) fixed<<setprecision(n)
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcountll(n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
const int MOD = (int) 1e9 + 7;
const int FFTMOD = 119 << 23 | 1;
const int INF = (int) 1e9 + 23111992;
const ll LINF = (ll) 1e18 + 23111992;
const ld PI = acos((ld) -1);
const ld EPS = 1e-9;
inline ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
inline ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
inline ll fpow(ll n, ll k, int p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}
template<class T> inline int chkmin(T& a, const T& val) {return val < a ? a = val, 1 : 0;}
template<class T> inline int chkmax(T& a, const T& val) {return a < val ? a = val, 1 : 0;}
inline ull isqrt(ull k) {ull r = sqrt(k) + 1; while (r * r > k) r--; return r;}
inline ll icbrt(ll k) {ll r = cbrt(k) + 1; while (r * r * r > k) r--; return r;}
inline void addmod(int& a, int val, int p = MOD) {if ((a = (a + val)) >= p) a -= p;}
inline void submod(int& a, int val, int p = MOD) {if ((a = (a - val)) < 0) a += p;}
inline int mult(int a, int b, int p = MOD) {return (ll) a * b % p;}
inline int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}
inline int sign(ld x) {return x < -EPS ? -1 : x > +EPS;}
inline int sign(ld x, ld y) {return sign(x - y);}
mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int mrand() {return abs((int) mt());}
#define db(x) cerr << "[" << #x << ": " << (x) << "] ";
#define endln cerr << "\n";

void chemthan() {
    long long n; cin >> n;
    vector<vi> g(3, vi(2));
    FOR(i, 0, 2) cin >> g[0][i] >> g[1][i] >> g[2][i];
    int res = n;
    long long perm(3);
    FOR(i, 0, 3) perm[i] = i;
    FOR(msk, 0, 1 << 3) {
        do {
            vi f(3);
            long long t = n;
            FOR(i, 0, 3) if (bit(msk, i)) {
                int x = perm[i];
                f[x] = t / g[x][0];
                t %= g[x][0];
            }
            FOR(i, 0, 3) {
                t += g[i][1] * f[i];
            }
            chkmax(res, t);
        }
        while (next_permutation(all(perm)));
    }
    cout << res << "\n";
}

int main(int argc, char* argv[]) {
    ios_base::sync_with_stdio(0), cin.tie(0);
    if (argc > 1) {
        assert(freopen(argv[1], "r", stdin));
    }
    if (argc > 2) {
        assert(freopen(argv[2], "wb", stdout));
    }
    chemthan();
    cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}


Compiler output:
a.cc: In function 'void chemthan()':
a.cc:58:22: error: invalid types 'long long int[int]' for array subscript
   58 |     FOR(i, 0, 3) perm[i] = i;
      |                      ^
a.cc:64:29: error: invalid types 'long long int[int]' for array subscript
   64 |                 int x = perm[i];
      |                             ^
a.cc:71:19: error: no matching function for call to 'chkmax(int&, long long int&)'
   71 |             chkmax(res, t);
      |             ~~~~~~^~~~~~~~
a.cc:38:30: note: candidate: 'template<class T> int chkmax(T&, const T&)'
   38 | template<class T> inline int chkmax(T& a, const T& val) {return a < val ? a = val, 1 : 0;}
      |                              ^~~~~~
a.cc:38:30: note:   template argument deduction/substitution failed:
a.cc:71:19: note:   deduced conflicting types for parameter 'const T' ('int' and 'long long int')
   71 |             chkmax(res, t);
      |             ~~~~~~^~~~~~~~
a.cc:12:20: error: request for member 'begin' in 'perm', which is of non-class type 'long long int'
   12 | #define all(a) (a).begin(), (a).end()
      |                    ^~~~~
a.cc:73:33: note: in expansion of macro 'all'
   73 |         while (next_permutation(all(perm)));
      |                                 ^~~
a.cc:12:33: error: request for member 'end' in 'perm', which is of non-class type 'long long int'
   12 | #define all(a) (a).begin(), (a).end()
      |                                 ^~~
a.cc:73:33: note: in expansion of macro 'all'
   73 |         while (next_permutation(all(perm)));
      |                                 ^~~