Alkuluvut

#include <bits/stdc++.h>

typedef long long ll;

using namespace std;

bool isPrime(ll a) {
  for (ll i = 2; i * i <= a; i++) {
    if (a % i == 0)
      return false;
  }
  return true;
}

bool isOk(string s) {
  if (s[0] == '0')
    return false;
  return isPrime(atoll(s.c_str()));
}

string solve(string luvut) {
  int tries = 100000;
  while (tries--) {
    string luku;
    for (auto u : luvut)
      luku.push_back(u);
    int lol = max(0, max(2, rand() % 16) - (int)luku.size());
    for (int i = 0; i < lol; i++) {
      luku.push_back(luvut[rand() % luvut.size()]);
    }
    random_shuffle(luku.begin(), luku.end());
    if (isPrime(atoll(luku.c_str()))) {
      return "YES\n"+luku;
    }
  }
  return "NO";
}

int main() {
  int t;
  cin >> t;
  while (t--) {
    int k;
    cin >> k;
    string luvut(k, '0');
    for (int i = 0; i < k; i++)
      cin >> luvut[i];
    cout << solve(luvut) << "\n";
  }
}

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

Test 2

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED