Special Prime (keteki)

CodeChefOpen on judge ↗

Given an array of $N$ integers. . A number in the array is said to be a special prime if it satisfies the following conditions : $1$. It is a prime. $2$. It has exactly two distinct multiples in the given array. Find the smallest special prime in the sequence. If no element of array satisfies the above then print $-1$. Input: - First line will contain $N$, number of elements of the arra

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.

voice by Sarvam AI