Given a number N. At every step, subtract the largest perfect square( ≤ N) from N. Repeat this step while N > 0. The task is to count the number of steps that can be performed.
Input: N = 85
First step, 85 – (9 * 9) = 4
Second step 4 – (2 * 2) = 0
Input: N = 114
First step, 114 – (10 * 10) = 14
Second step 14 – (3 * 3) = 5
Third step 5 – (2 * 2) = 1
Fourth step 1 – (1 * 1) = 0
Approach: Iteratively subtract the largest perfect square (≤ N) from N while N > 0 and count the number of steps.
Below is the implementation of the above approach:
- Largest number that is not a perfect square
- Largest perfect square number in an Array
- Largest factor of a given number which is a perfect square
- Largest Divisor of a Number not divisible by a perfect square
- Find minimum number to be divided to make a number a perfect square
- Check if a number is perfect square without finding square root
- Check if given number is perfect square
- Find the Next perfect square greater than a given number
- Check whether the number can be made perfect square after adding 1
- Minimum digits to remove to make a number Perfect Square
- Largest number in an array that is not a perfect cube
- Check if there exists a prime number which gives Y after being repeatedly subtracted from X
- Count numbers upto N which are both perfect square and perfect cube
- Number of times a number can be replaced by the sum of its digits until it only contains one digit
- Largest number dividing maximum number of elements in the array
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.