Dipto and numbers
CodeChefOpen on judge ↗
Dipto is a very smart boy. He loves numbers, especially those in which the sum of the digits is a prime number($example$ 32=3+2=5 which is prime). Given a number $X$ he wants to find the number of terms less than equal to $X$ whose digit sum is a prime number. Unfortunately his semesters are knocking at the door so he needs your help to figure out the number of such terms less than equal to $X$.
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