func_code_string: #include <bits/stdc++.h>   using namespace std;   vector<bool> isprime(1005, true);   vector<long long> spf(1005, 0);   vector<long long> prime;   void sieve() {     isprime[0] = isprime[1] = false;     for (long long i = 2; i < 1005; i++) {       if (isprime[i]) {         for (long long j = 2 * i; j < 1005; j += i) {           isprime[j] = false;           if (spf[j] == 0) {             spf[j] = i;           }         }         prime.push_back(i);       }     }   }   long long power(long long k, long long n, long long m = 1000000007) {     long long res = 1;     while (n) {       if (n % 2 != 0) {         res = (res * k) % m;       }       k = (k * k) % m;       n = n / 2;     }     return (res);   }   void READ(vector<long long> &v, long long n) {     long long a;     for (long long i = 0; i < n; i = i + 1) {       cin >> a;       v.push_back(a);     }   }   void PRINT(vector<long long> &v, long long a = 0) {     for (long long i = a; i < v.size(); i = i + 1) {       cout << v[i] <<    ;     }     cout <<   n ;   }   long long n, m, k;   int main() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     cout.tie(NULL);     std::cout.unsetf(std::ios::floatfield);     std::cout.precision(12);     long long a, b, c, d, e, x, i, j, t, y, w, z, x1, y1, z1, f;     string str, str1, str2, str4;     cin >> n >> a >> b;     if (a * b >= 6 * n) {       cout << a * b <<   n  << a <<     << b;       exit(0);     }     x = y = 1e18;     d = 0;     for (j = 0;; j++) {       c = 0;       for (i = min(a, b); i * i <= 6 * n + j; i++) {         if ((6 * n + j) % i == 0) {           if (i >= a && (6 * n + j) / i >= b) {             x = i;             y = (6 * n + j) / i;             c = 1;             break;           }           if (i >= b && (6 * n + j) / i >= a &&               i - b + (6 * n + j) / i - a < x - a + y - b) {             y = i;             x = (6 * n + j) / i;             c = 1;             break;           }         }       }       if (c) {         break;       }     }     cout << x * y <<   n  << x <<     << y;   }   