Given an integer N, the task is to find the smallest and the largest N digit numbers which are also perfect cubes.
Input: N = 2
Output: 27 64
27 and 64 are the smallest and the largest 2-digit numbers which are also perfect cubes.
Input: N = 3
Output: 125 729
Approach: For increasing values of N starting from N = 1, the series will go on like 8, 64, 729, 9261, ….. for the largest N-digit perfect cube whose Nth term will be pow(ceil(cbrt(pow(10, (n))))-1, 3).
And 1, 27, 125, 1000, ….. for the smallest N-digit perfect cube whose Nth term will be pow(ceil(cbrt(pow(10, (n – 1)))), 3).
Below is the implementation of the above approach:
- Smallest and Largest N-digit perfect squares
- Perfect cubes in a range
- Numbers less than N that are perfect cubes and the sum of their digits reduced to a single digit is 1
- Largest number that is not a perfect square
- Smallest perfect Cube divisible by all elements of an array
- Largest sub-array whose all elements are perfect squares
- Largest number in an array that is not a perfect cube
- Largest factor of a given number which is a perfect square
- Largest Divisor of a Number not divisible by a perfect square
- Smallest and Largest sum of two n-digit numbers
- Smallest and Largest Palindrome with N Digits
- Number of times the largest perfect square number can be subtracted from N
- Sum and product of k smallest and k largest prime numbers in the array
- Sum and product of k smallest and k largest composite numbers in the array
- Split the number into N parts such that difference between the smallest and the largest part is minimum
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.