Snow Leopard and sum of primes

CodeChefOpen on judge ↗

Snow Leopard has been given an integer ‘n’. Now he has to tell whether 2n can be written as a sum of two prime numbers or not. Please help him calculate this efficiently. Input - The first line has a number T, indicating the number of test cases. Next T lines contain a number 'n' each. Output - T lines printing “YES” or “NO” if it can be written as a sum of two prime numbers or not(w/o “”)

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