Algorithms and Data Structures

  • Profound Academy

    • Status
      • 1
        Implementation
      • 2
        Bitwise operations
      • 3
        Prefix Sums
      • 4
        Sliding window / Two pointers
      • 5
        Modular Arithmetic
      • 6
        Number Theory
      • 7
        Binary Search
      • 8
        Basic Sorting
      • 9
        Greedy Algorithms
      • 10
        Basic Dynamic Programming
      • 11
        Recursion
      • 12
        Linked LIst
      • 13
        Queue & Stack
      • 14
        Binary tree + BST
      • 15
        Divide & Conquer + Advanced Sorting
      • 16
        Heap
      • 17
        Hashing
      • 18
        Graph Representation
      • 19
        BFS

    • Removing digits

    Given an integer n, you are asked to calculate the minimum number of steps that would be required to get from n to 0. On each step, you are allowed to subtract one of the digits from the number.

    Input

    The input contains a single integer n (1 ≤ n ≤ ).

    Output

    The program should print the minimum number of steps we should take to get from n to 0.

    Examples

    Input
    Output
    9
    1
    11
    3
    27
    5

    Explanation

    1. 9 → 0 ⇒ 1 step
    1. 11 → 10 → 9 → 0 ⇒ 3 steps
    1. 27 → 20 → 18 → 10 → 9 → 0 ⇒ 5 steps
     

    Constraints

    Time limit: 5 seconds

    Memory limit: 512 MB

    Output limit: 1 MB

    To check your solution you need to sign in
    Sign in to continue