Counting Numbers

CSESDynamic ProgrammingOpen on judge ↗

Your task is to count the number of integers between a and b where no two adjacent digits are the same. Input The only input line has two integers a and b. Output Print one integer: the answer to the problem. Constraints - 0 \le a \le b \le 10^{18} Example Input: 123 321 Output: 171

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