Check perfect square
Submissions: 1699   Accuracy:

54.9%

  Difficulty: Basic   Marks: 1

Given a positive integer n, check if it is perfect square or not.
Note: Try to solve the question using only addition and subtraction operation.

Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains an integer the integer n.

Output:
Print 1 if n is a perfect square else print 0. Print the answer for each test case in a new line.

Constraints:
1<= T <=100
1<= N <=100000

Example:
Input:
1
35
49

Output:
0
1

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Sujnesh Mishra
Author: sujnesh


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.