Prem with Primes
CodeChefOpen on judge ↗
*Since everyone know what prime numbers are, there's no need to an introduction, because we love it, yes, we nerds.* Given a number **N**, find the minimum number of **primatic** numbers which sum upto **N**. A **primatic** number refers to a number which is either a prime number or can be expressed as power of prime number to itself i.e. *primeprime* e.g. 4, 27, etc. **Note:** 8, 32, etc are *
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