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;
}

int64_t to_number(const std::vector<int64_t>& N) {
    int64_t x = 0;
    for (const auto n : N) {
        x *= 10;
        x += n;
    }
    return x;
}

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] == 2 && N[1] == 5) {
        return false;
    }
    bool ok = false;
    for (const auto n : N) {
        if (n % 2) {
            ok = true;
        }
    }
    if (!ok) {
        return false;
    }
    static std::random_device rd;
    static std::mt19937 g(rd());
    auto N2 = N;
    while (N2.size() < 16) {
        for (int j = 0; j < 100; ++j) {
            do {
                std::shuffle(N2.begin(), N2.end(), g);
            } while (N2.back() % 2 == 0);
            const auto n = to_number(N2);
            if (is_prime(n)) {
                std::cout << "YES\n" << n << '\n';
                return true;
            }
        }
        N2.push_back(N[rand() % N.size()]);
    }
    return false;
}

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;
        }
        std::sort(N.begin(), N.end());
        if ((k == 1 && N.back() == 0) || !ok(N)) {
            std::cout << "NO\n";
        }
    }
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: WRONG ANSWER

Test 3

Group: 3

Verdict: WRONG ANSWER