Alkuluvut

#include <bits/stdc++.h>

constexpr auto L = 1e6;
using i128 = __int128_t;
 
std::vector<int64_t> P = []() {
    std::vector<int64_t> p(L + 1, true);
    p[0] = p[1] = false;
    for (int64_t i = 2; i <= L; ++i) {
        if (p[i]) {
            for (int64_t j = i * i; j <= L; j += i) {
                p[j] = false;
            }
        }
    }
    return p;
}();
 
i128 m_pow(i128 b, i128 exp, i128 m) {
    i128 res = 1;
    b %= m;
    while (exp) {
        if (exp & 1) {
            (res *= b) %= m;
        }
        (b *= b) %= m;
        exp >>= 1;
    }
    return res;
}
 
bool mr_check(i128 n, i128 p, i128 d, int s) {
    auto x = m_pow(p, d, n);
    if (x == 1 || x == n - 1) {
        return false;
    }
    for (auto r = 1; r < s; ++r) {
        (x *= x) %= n;
        if (x == n - 1) {
            return false;
        }
    }
    return true;
}
 
bool is_prime(int64_t x) {
    if (x <= L) {
        return P[x];
    }
    auto r = 0;
    auto d = x - 1;
    while ((d & 1) == 0) {
        d >>= 1;
        r++;
    }
    for (const auto p : {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37}) {
        if (mr_check(x, p, d, r)) {
            return false;
        }
    }
    return true;
}

void check(const std::vector<int64_t>& N, std::vector<int>& used, int64_t x, std::size_t sz, bool& ok) {
    if (sz >= N.size() && is_prime(x)) {
        std::cout << "YES\n" << x << '\n';
        ok = true;
        return;
    }
    if (sz == 16) {
        return;
    }
    std::vector<int> I(N.size());
    std::iota(I.begin(), I.end(), 0);
    std::sort(I.begin(), I.end(), [&used](const auto& a, const auto& b) { return used[a] < used[b]; });
    for (const auto i : I) {
        ++used[i];
        check(N, used, x * 10 + N[i], sz + 1, ok);
        if (ok) {
            return;
        }
        --used[i];
    }
}

bool ok(const std::vector<int64_t>& N) {
    if (N.size() == 1 && N.back() == 2) {
        std::cout << "YES\n2\n";
        return true;
    }
    if (N.size() == 2 && N[0] * N[1] == 10) {
        return false;
    }
    bool ok = false;
    for (const auto n : N) {
        if (n % 2) {
            ok = true;
        }
    }
    if (!ok) {
        return false;
    }
    std::vector<int> used(N.size());
    check(N, used, 0, 0, ok = false);
    return ok;
}

int main() {
    int t;
    std::cin >> t;
    for (int i = 0, k; i < t; ++i) {
        std::cin >> k;
        std::vector<int64_t> N(k);
        for (auto& n : N) {
            std::cin >> n;
        }
        if (!ok(N)) {
            std::cout << "NO\n";
        }
    }
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED