# Steps to reduce N to zero by subtracting its most significant digit at every step

Given a number . Reduce this number to zero by subtracting the number by it’s most significant digit(Left most digit) at every step. The task is to count the number of steps it takes to be reduced to zero.

**Examples**:

Input:14Output:6Steps: 14 - 1 = 13 13 - 1 = 12 12 - 1 = 11 11 - 1 = 10 10 - 1 = 9 9 - 9 = 0Input:20Output:12 Numbers after series of steps: 20, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 0

**Naive Approach**: A naive approach is to reduce the number by its first digit step-wise and find the count of steps, but the time complexity will be huge if a large number is provided.

**Efficient Approach:** The main idea of the efficient approach is to reduce the number of steps in the naive approach. We can skip the steps whose leading digits are the same in consecutive numbers, and count them. The algorithm of skipping those numbers with same leading digits is as follows:

- Let the number be last, count the digits in last and reduce it by 1, because the smallest number with same leading digit with same count of digits will have that number of zeros in it.
- Find the first digit of number of last, by last/count.
- Hence the smallest number of same number of count of digits with same leading number will be
**[first digit * (count-1)]** - the number of steps skipped can be achieved by
**[(last-smallest number)/first digit]**. - Hence the next number last will be
**last – (first*skipped)**

Below is the implementation of the above approach:

## C++

`// C++ program to find the count of Steps to ` `// reduce N to zero by subtracting its most ` `// significant digit at every step ` ` ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Function to count the number ` `// of digits in a number m ` `int` `countdig(` `int` `m) ` `{ ` ` ` `if` `(m == 0) ` ` ` `return` `0; ` ` ` `else` ` ` `return` `1 + countdig(m / 10); ` `} ` ` ` `// Function to count the number of ` `// steps to reach 0 ` `int` `countSteps(` `int` `x) ` `{ ` ` ` `// count the total number of stesp ` ` ` `int` `c = 0; ` ` ` `int` `last = x; ` ` ` ` ` `// iterate till we reach 0 ` ` ` `while` `(last) { ` ` ` ` ` `// count the digits in last ` ` ` `int` `digits = countdig(last); ` ` ` ` ` `// decrease it by 1 ` ` ` `digits -= 1; ` ` ` ` ` `// find the number on whose divison, ` ` ` `// we get the first digit ` ` ` `int` `divisor = ` `pow` `(10, digits); ` ` ` ` ` `// first digit in last ` ` ` `int` `first = last / divisor; ` ` ` ` ` `// find the first number less than ` ` ` `// last where the first digit changes ` ` ` `int` `lastnumber = first * divisor; ` ` ` ` ` `// find the number of numbers ` ` ` `// with same first digit that are jumped ` ` ` `int` `skipped = (last - lastnumber) / first; ` ` ` ` ` `skipped += 1; ` ` ` ` ` `// count the steps ` ` ` `c += skipped; ` ` ` ` ` `// the next number with a different ` ` ` `// first digit ` ` ` `last = last - (first * skipped); ` ` ` `} ` ` ` ` ` `return` `c; ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `int` `n = 14; ` ` ` ` ` `cout << countSteps(n); ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java program to find the count of Steps to ` `// reduce N to zero by subtracting its most ` `// significant digit at every step ` ` ` ` ` `class` `GFG{ ` `// Function to count the number ` `// of digits in a number m ` `static` `int` `countdig(` `int` `m) ` `{ ` ` ` `if` `(m == ` `0` `) ` ` ` `return` `0` `; ` ` ` `else` ` ` `return` `1` `+ countdig(m / ` `10` `); ` `} ` ` ` `// Function to count the number of ` `// steps to reach 0 ` `static` `int` `countSteps(` `int` `x) ` `{ ` ` ` `// count the total number of stesp ` ` ` `int` `c = ` `0` `; ` ` ` `int` `last = x; ` ` ` ` ` `// iterate till we reach 0 ` ` ` `while` `(last>` `0` `) { ` ` ` ` ` `// count the digits in last ` ` ` `int` `digits = countdig(last); ` ` ` ` ` `// decrease it by 1 ` ` ` `digits -= ` `1` `; ` ` ` ` ` `// find the number on whose divison, ` ` ` `// we get the first digit ` ` ` `int` `divisor = (` `int` `)Math.pow(` `10` `, digits); ` ` ` ` ` `// first digit in last ` ` ` `int` `first = last / divisor; ` ` ` ` ` `// find the first number less than ` ` ` `// last where the first digit changes ` ` ` `int` `lastnumber = first * divisor; ` ` ` ` ` `// find the number of numbers ` ` ` `// with same first digit that are jumped ` ` ` `int` `skipped = (last - lastnumber) / first; ` ` ` ` ` `skipped += ` `1` `; ` ` ` ` ` `// count the steps ` ` ` `c += skipped; ` ` ` ` ` `// the next number with a different ` ` ` `// first digit ` ` ` `last = last - (first * skipped); ` ` ` `} ` ` ` ` ` `return` `c; ` `} ` ` ` `// Driver code ` `public` `static` `void` `main(String[] args) ` `{ ` ` ` `int` `n = ` `14` `; ` ` ` ` ` `System.out.println(countSteps(n)); ` `} ` `} ` `// This code is contributed by mits ` |

*chevron_right*

*filter_none*

## Python 3

`# Python 3 program to find the ` `# count of Steps to reduce N to ` `# zero by subtracting its most ` `# significant digit at every step ` ` ` `# Function to count the number ` `# of digits in a number m ` `def` `countdig(m) : ` ` ` ` ` `if` `(m ` `=` `=` `0` `) : ` ` ` `return` `0` ` ` `else` `: ` ` ` `return` `1` `+` `countdig(m ` `/` `/` `10` `) ` ` ` `# Function to count the number ` `# of steps to reach 0 ` `def` `countSteps(x) : ` ` ` ` ` `# count the total number ` ` ` `# of stesp ` ` ` `c ` `=` `0` ` ` `last ` `=` `x ` ` ` ` ` `# iterate till we reach 0 ` ` ` `while` `(last) : ` ` ` ` ` `# count the digits in last ` ` ` `digits ` `=` `countdig(last) ` ` ` ` ` `# decrease it by 1 ` ` ` `digits ` `-` `=` `1` ` ` ` ` `# find the number on whose ` ` ` `# divison, we get the first digit ` ` ` `divisor ` `=` `pow` `(` `10` `, digits) ` ` ` ` ` `# first digit in last ` ` ` `first ` `=` `last ` `/` `/` `divisor ` ` ` ` ` `# find the first number less ` ` ` `# than last where the first ` ` ` `# digit changes ` ` ` `lastnumber ` `=` `first ` `*` `divisor ` ` ` ` ` `# find the number of numbers ` ` ` `# with same first digit that ` ` ` `# are jumped ` ` ` `skipped ` `=` `(last ` `-` `lastnumber) ` `/` `/` `first ` ` ` ` ` `skipped ` `+` `=` `1` ` ` ` ` `# count the steps ` ` ` `c ` `+` `=` `skipped ` ` ` ` ` `# the next number with a different ` ` ` `# first digit ` ` ` `last ` `=` `last ` `-` `(first ` `*` `skipped) ` ` ` ` ` `return` `c ` ` ` `# Driver code ` `n ` `=` `14` `print` `(countSteps(n)) ` ` ` `# This code is contributed by ANKITRAI1 ` |

*chevron_right*

*filter_none*

## C#

`// C# program to find the count of Steps to ` `// reduce N to zero by subtracting its most ` `// significant digit at every step ` `using` `System; ` ` ` `class` `GFG{ ` `// Function to count the number ` `// of digits in a number m ` `static` `int` `countdig(` `int` `m) ` `{ ` ` ` `if` `(m == 0) ` ` ` `return` `0; ` ` ` `else` ` ` `return` `1 + countdig(m / 10); ` `} ` ` ` `// Function to count the number of ` `// steps to reach 0 ` `static` `int` `countSteps(` `int` `x) ` `{ ` ` ` `// count the total number of stesp ` ` ` `int` `c = 0; ` ` ` `int` `last = x; ` ` ` ` ` `// iterate till we reach 0 ` ` ` `while` `(last>0) { ` ` ` ` ` `// count the digits in last ` ` ` `int` `digits = countdig(last); ` ` ` ` ` `// decrease it by 1 ` ` ` `digits -= 1; ` ` ` ` ` `// find the number on whose divison, ` ` ` `// we get the first digit ` ` ` `int` `divisor = (` `int` `)Math.Pow(10, digits); ` ` ` ` ` `// first digit in last ` ` ` `int` `first = last / divisor; ` ` ` ` ` `// find the first number less than ` ` ` `// last where the first digit changes ` ` ` `int` `lastnumber = first * divisor; ` ` ` ` ` `// find the number of numbers ` ` ` `// with same first digit that are jumped ` ` ` `int` `skipped = (last - lastnumber) / first; ` ` ` ` ` `skipped += 1; ` ` ` ` ` `// count the steps ` ` ` `c += skipped; ` ` ` ` ` `// the next number with a different ` ` ` `// first digit ` ` ` `last = last - (first * skipped); ` ` ` `} ` ` ` ` ` `return` `c; ` `} ` ` ` `// Driver code ` `static` `void` `Main() ` `{ ` ` ` `int` `n = 14; ` ` ` ` ` `Console.WriteLine(countSteps(n)); ` `} ` `} ` `// This code is contributed by mits ` |

*chevron_right*

*filter_none*

## PHP

**Output:**

6

## Recommended Posts:

- Count number of step required to reduce N to 1 by following certain rule
- Program to make Indian Flag in Python | Step by Step
- Minimum sum after subtracting multiples of k from the elements of the array
- Check if it is possible to get back to 12'0 clock only by adding or subtracting given seconds
- Count of Numbers in Range where first digit is equal to last digit of the number
- Largest number less than N with digit sum greater than the digit sum of N
- Count 'd' digit positive integers with 0 as a digit
- Minimum sum of the elements of an array after subtracting smaller elements from larger
- Reach A and B by multiplying them with K and K^2 at every step
- Minimum step to reach one
- Check if frequency of each digit is less than the digit
- Count n digit numbers not having a particular digit
- Delete odd and even numbers at alternate step such that sum of remaining elements is minimized
- Round-off a number to a given number of significant digits
- Find maximum operations to reduce N to 1

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.