Digit Sum Mod 3 Equals 1

Difficulty: 1900 4000 ms 128 MB

digit-dp

Count integers in [L, R] whose digit sum leaves remainder 1 when divided by 3.

Input: one line with two integers L and R.

Output: the count in [L, R].

Constraints:

• 1 ≤ L ≤ R ≤ 10¹⁸

Sample Tests

1 30

10

10 40

11

Read the Editorial