Subtract Digits to Reach Zero

At each step, choose a nonzero decimal digit currently present in the number and subtract that digit. Digits are taken from the new value after every step. Find the minimum number of steps needed to reach zero.

Implement removing_digits(n).

Input

n: The positive starting number.

Output

Return the fewest subtraction steps.

Vincoli

1 ≤ n ≤ 1,000,000. Subtracting zero is not a useful move and is excluded.

Esempi

Input:
n = 14

Output atteso:
expected = 3

Input:
long long n = 14;

Output atteso:
long long expected = 3;

Input:
long n = 14;

Output atteso:
long expected = 3;

Input:
n = 7

Output atteso:
expected = 1

Input:
long long n = 7;

Output atteso:
long long expected = 1;

Input:
long n = 7;

Output atteso:
long expected = 1;

Riferimenti

Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.

• Removing Digits — 1637