← All problemsSign in

Stepping Numbers

CodeChefRating 2211Open on judge ↗

Call a number stepping if adjacent digits, as well as the first and last digits, differ by one. How many n-digit base 11 stepping numbers are there? Give your answer modulo 4294967143. For example, 8789A9 is a 6-digit base 11 stepping number. 9A0A and 234 are not stepping. Input The first line contains an integer T, the number of test cases (about 20000). Each of the next T lines contains an in

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

Sign in to chat with the tutor and save your progress.

Sign in to start