Given two positive integers N and K. Find the minimum number of digits that can be removed from the number N such that after removals the number is divisible by 10K or print -1 if it is impossible.
Input : N = 10904025, K = 2 Output : 3 Explanation : We can remove the digits 4, 2 and 5 such that the number becomes 10900 which is divisible by 102. Input : N = 1000, K = 5 Output : 3 Explanation : We can remove the digits 1 and any two zeroes such that the number becomes 0 which is divisible by 105 Input : N = 23985, K = 2 Output : -1
Approach : The idea is to start traversing the number from the last digit while keeping a counter. If the current digit is not zero, increment the counter variable, otherwise decrement variable K. When K becomes zero, return counter as answer. After traversing the whole number, check if the current value of K is zero or not. If it is zero, return counter as answer, otherwise return answer as number of digits in N – 1, since we need to reduce the whole number to a single zero which is divisible by any number. Also, if the given number does not contain any zero, return -1 as answer.
Below is the implementation of above approach.
# Python3 Program to count the number
# of digits that can be removed such
# that number is divisible by 10^K
# function to return the required
# number of digits to be removed
def countDigitsToBeRemoved(N, K):
# Converting the given number
# into string
s = str(N);
# variable to store number of
# digits to be removed
res = 0;
# variable to denote if atleast
# one zero has been found
f_zero = 0;
for i in range(len(s) – 1, -1, -1):
if (K == 0):
if (s[i] == ‘0’):
# zero found
f_zero = 1;
K -= 1;
res += 1;
# return size – 1 if K is not zero and
# atleast one zero is present, otherwise
if (K == 0):
elif (f_zero > 0):
return len(s) – 1;
# Driver Code
N = 10904025;
K = 2;
N = 1000;
K = 5;
N = 23985;
K = 2;
# This code is contributed by mits
3 3 -1
Time Complexity :Number of digits in the given number.
- Number of digits in 2 raised to power n
- Check if a number can be expressed as x^y (x raised to power y)
- Find last five digits of a given five digit number raised to power five
- Larger of a^b or b^a (a raised to power b or b raised to power a)
- GCD of a number raised to some power and another number
- K-th digit in 'a' raised to power 'b'
- Find value of y mod (2 raised to power x)
- Print last k digits of a^b (a raised to power b)
- Find unit digit of x raised to power y
- Find multiple of x closest to or a ^ b (a raised to power b)
- Minimum removals to make array sum odd
- Minimum removals from array to make GCD greater
- Minimum number of power terms with sum equal to n
- Minimum value that divides one number and divisible by other
- Minimum number of given moves required to make N divisible by 25
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. 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.