Finding Square Roots solution

Problem

 

In olden days finding square roots seemed to be difficult but nowadays it can be easily done using in-built functions available across many languages .

Assume that you happen to hear the above words and you want to give a try in finding the square root of any given integer using in-built functions. So here's your chance.

Input

The first line of the input contains an integer T, the number of test cases. T lines follow. Each line contains an integer N whose square root needs to be computed.

Output

For each line of the input, output the square root of the input integer, rounded down to the nearest integer, in a new line.

Constraints

1<=T<=20
1<=N<=10000

Sample 1:

Input

Output

3
10
5
10000

3
2
100

Program :

//We have populated the solutions for the 10 easiest problems for your support.

//Click on the SUBMIT button to make a submission to this problem.

#include <stdio.h>

#include <math.h>

int main(void) 

{

int t,n,r;

scanf("%d",&t);

while(t--)

{

    scanf("%d",&n);  

    r=sqrt(n);

    printf("%d\n",r);

}

return 0;

}