Given positive integers N and K, the task is to find the highest and smallest power of K greater than equal to and less than equal to N respectively.
Input: N = 3, K = 2
Output: 2 4
Highest power of 2 less than 3 = 2
Smallest power of 2 greater than 3 = 4
Input: N = 6, K = 3
Output: 3 9
Highest power of 3 less than 6 = 2
Smallest power of 3 greater than 6 = 9
- Compute the log of N in base K (logK N) to get the exponential power such that K raised to this exponent is the Highest power of K less than equal to N.
- For the Smallest power of K less than equal to N, find the next power of K computed from the last step
Below is the implementation of the above approach:
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Highest power of 2 less than or equal to given number
- Highest power of 2 less than or equal to given Integer
- Smallest power of 2 greater than or equal to n
- Smallest power of 4 greater than or equal to N
- Smallest subarray of size greater than K with sum greater than a given value
- Minimize array sum by replacing greater and smaller elements of pairs by half and double of their values respectively atmost K times
- Smallest number greater than n that can be represented as a sum of distinct power of k
- Count ways to generate pairs having Bitwise XOR and Bitwise AND equal to X and Y respectively
- Highest power of a number that divides other number
- Highest power of 2 that divides a number represented in binary
- Count of pairs in an array such that the highest power of 2 that divides their product is 1
- Highest power of 2 that divides the LCM of first N Natural numbers.
- Largest number with maximum trailing nines which is less than N and greater than N-D
- Maximize array sum by replacing equal adjacent pairs by their sum and X respectively
- Largest number less than N with digit sum greater than the digit sum of N
- Size of smallest subarray to be removed to make count of array elements greater and smaller than K equal
- Smallest number greater than or equal to N divisible by K
- Smallest Special Prime which is greater than or equal to a given number
- Smallest number greater than or equal to X whose sum of digits is divisible by Y
- Smallest subarray from a given Array with sum greater than or equal to K
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.