Digit Sum at Most 9

Difficulty: 1900 4000 ms 128 MB

digit-dp

Count integers in [L, R] whose digit sum is at most 9.

Input: one line with two integers L and R.

Output: the count in [L, R].

Constraints:

• 1 ≤ L ≤ R ≤ 10¹⁸

Sample Tests

1 30

27

100 200

46

Read the Editorial