Numbers That Only Climb

Difficulty: 1700 3000 ms 128 MB

digit-dp

Count the integers in [L, R] whose digits are non-decreasing left to right (like 1358).

Input: one line with two integers L and R.

Output: the count of qualifying integers in [L, R].

Constraints:

• 1 ≤ L ≤ R ≤ 10¹⁸

Sample Tests

1 30

26

100 200

45

Read the Editorial