


The first line of input contains an integer ‘T’ denoting the number of test cases to run. Then the test cases follow.
The first line of each test case contains a single integer ‘A’.
For each test case, print the greatest positive integer whose square is less than or equal to ‘A’.
Print the output of each test case in a separated line.
You do not need to print anything; it has already been taken care of. Just implement the given function.
We will iterate over all possible integers from 0 to ‘A’ and return the greatest possible integer whose square is less than or equal to ‘A’.
Algorithm
Let our final answer be ‘x’. For all numbers (r <= x), r * r will be less than or equal to ‘A’ and for all numbers (r > x), r * r will be greater than ‘A’. Hence, we can binary search for this number ‘x’.
Algorithm
Pair Product Div by K
Pair Product Div by K
Merge Two Sorted Arrays Without Extra Space
Merge Two Sorted Arrays Without Extra Space
Co-Prime
First Digit One
Special Digit Numbers