Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Digits That Only Fall

Digits That Only Fall

Difficulty: 1700 4000 ms 128 MB

digit-dp

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

Input: one line with two integers L and R.

Output: the count in [L, R].

Constraints:

  • 1 ≤ L ≤ R ≤ 1018

Sample Tests

Input 1
1 30
Output 1
15
Input 2
50 90
Output 2
31

Read the Editorial Statistics

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen