Given two positive integers N and K, the task is to find the minimum number to be added to N to make it a power of K.
Input: N = 9, K = 10
9 + 1 = 10 = 101
Input: N = 20, K = 5
20 + 5 = 25 = 52
Approach: The idea to solve this problem is to observe that the minimum power of K which can be formed from N is the next greater power of K. So, the idea is to find the next greater power of K and find the difference between N and this number. The next greater power of K can be found by the formula,
Kint(log(N)/log(K)) + 1
Therefore, the minimum number to be added can be computed by:
Minimum Number = Kint(log(N)/log(K)) + 1 – N
Below is the implementation of the above approach:
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- Find the minimum number to be added to N to make it a prime number
- Minimum number to be added to all digits of X to make X > Y
- Minimum number of Parentheses to be added to make it valid
- Find minimum number to be divided to make a number a perfect square
- Find minimum number of coins that make a given value
- Least number to be added to or subtracted from N to make it a Perfect Square
- Least number to be added to or subtracted from N to make it a Perfect Cube
- Find the minimum number of elements that should be removed to make an array good
- Find minimum number of merge operations to make an array palindrome
- Smallest number to be added in first Array modulo M to make frequencies of both Arrays equal
- Find the minimum number of operations required to make all array elements equal
- Minimum number of power terms with sum equal to n
- Minimum removals in a number to be divisible by 10 power raised to K
- Minimum number of swaps required to make a number divisible by 60
- Minimum divisor of a number to make the number perfect cube
- Find whether a given number is a power of 4 or not
- Find the super power of a given Number
- Find minimum operations needed to make an Array beautiful
- Minimum number of changes required to make the given array an AP
- Minimum number of elements to be removed to make XOR maximum
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.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.