REVERSE LENGTH DIVISBLE

CodeChefOpen on judge ↗

Reverse Length Divisible Given a number N, check if it is reverse length divisible. A number is said to be reverse length divisible if the first i digits of the number is divisible by (l-i+1) where l is the number of digits in N and 0 < i <= l. For example, 652281 is reverse length divisible because: 6 is divisible by 6 65 is divisible by 5 652 is divisible by 4 6522 is divisible by 3 6

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