← All problemsSign in

The Prime Pair

Uncle Benjamin wants John to learn about prime numbers. So he gives John a number $N$ and asks him to find a pair of distinct prime numbers ($P1$, $P2$) such that the sum of these two numbers is equal to $N$. *** ###Input: - First line of input consists of the number of test cases $T$. $T$ lines follow. - Each line consists of number $N$. *** ###Output: - For each test case $Ti$, display

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

Sign in to chat with the tutor and save your progress.

Sign in to start