giúp t với ạ. Làm bằng c++ ạ !!!!!!

$\color{#1fdb91}{\texttt{C}}\color{#0aaec9}{\texttt{+}}\color{#e9418e}{\texttt{+}}$

#include <bits/stdc++.h>

#define ll long long

using namespace std;

vector<ll> prime;

void sieve(ll maxn) {
    vector<ll> check(maxn+1, true);
    for (ll i=2; i*i<=maxn; ++i) {
        if (check[i]) {
            for (ll j=i*i; j<=maxn; j+=i) {
                check[j] = false;
            }
        }
    }
    for (ll i=2; i<=maxn; ++i) {
        if (check[i]) prime.push_back(i);
    }
}

ll res = LLONG_MAX, n;
void Try(ll i, ll now, ll cnt) {
    for (ll j=1; now * prime[i] <= res; ++j) {
        now *= prime[i];
        if (now < 0) return;
        if (cnt * (j+1) >= n) {
            if (cnt * (j+1) == n) res = min(res, now);
            else return;
        } else Try(i+1, now, cnt * (j+1));
    }
}

int main() {
    
    cin >> n;
    sieve(100);
    
    Try(0, 1, 1);
    
    cout << res;
    
}

// Author : Daoanhviet96
// Language : C++

$\\$
\begin{array}{c|c|c}\color{#ffd710}{\texttt{\{}} \color{#8655d6}{\texttt{\{}}\ \ \color{#8cdcda}{\text{Daoanhviet96}}\ \ \color{#8655d6}{\texttt{\}}} \color{#ffd710}{\texttt{\}}}\end{array}