Prime Addition
CodeChefOpen on judge ↗
Some natural numbers can be represented as an addition of two or more prime numbers (need not be distinct). For a given integer $N$, find minimum number of such **addition operations** required to represent $N$ as an addition of two or more prime numbers if possible otherwise print $-1$ instead. ###Input - The first line of the input contains a single integer $T$ denoting the number 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.
Sign in to chat with the tutor and save your progress.
Sign in to start