Given a number N, the task is to find the next perfect square greater than N.
Input: N = 6 Output: 9 9 is a greater number than 6 and is also a perfect square Input: N = 9 Output: 16
- Find the square root of given N.
- Calculate its floor value using floor function in C++.
- Then add 1 to it.
- Print square of that number.
Below is the implementation of above approach:
- Find minimum number to be divided to make a number a perfect square
- Check if a number is perfect square without finding square root
- Perfect cube greater than a given number
- Largest number that is not a perfect square
- Check if given number is perfect square
- Number of times the largest perfect square number can be subtracted from N
- Largest factor of a given number which is a perfect square
- Largest perfect square number in an Array
- Count numbers upto N which are both perfect square and perfect cube
- Check whether the number can be made perfect square after adding 1
- Largest Divisor of a Number not divisible by a perfect square
- Minimum digits to remove to make a number Perfect Square
- Check whether the number formed by concatenating two numbers is a perfect square or not
- Perfect Square String
- Print n numbers such that their sum is a perfect square
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.