Jedi Test
CodeChefOpen on judge ↗
Quigon and Obi Wan are really impressed with your ability since you helped them escape the assassins sent by Senator Palpatine. They feel that you are an ideal Jedi candidate. However to confirm their instincts, they need to test you one last time. To prove yourself, you are given two integers $a$ and $b$. Find the number of integers between a and b whose sum of digits is divisible by $x$ and prod
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