Yet Another Easy Problem
CodeChefOpen on judge ↗
You're given an array of $N$ elements. You need to find the $MEX$ of the prime divisors of the array, which is defined as the first prime number which doesn't divide any of the elements in the array. ### Input - First line will contain $T$, number of testcases. Then the testcases follow. - First line of each testcase contains a single integer $N$, the size of the array. - Next line contains $N$ s
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start