Dewansh & Conjecture

CodeChefOpen on judge ↗

Dewansh is interested in number theory and has read about a well-known conjecture called “Goldbach Conjecture” . According to this conjecture, every even number greater than 2 can be written as the sum of any two prime numbers. Now Dewansh has an array A with N elements and he wants to find the product of those two prime numbers for each element A[i] , (0 Note : There can be more than one pair of

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