Algorithm

 problem Link :  https://www.codechef.com/problems/FSQRT 

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

 

Code Examples

#1 Code Example with C Programming

Code - C Programming

#include<stdio.h>
#include < math.h>

int main()
{
    int t,x,r;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&x);
        r=sqrt(x);
        printf("%d\n",r);
    }
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
3
10
5
10000

Output

x
–
+
cmd
3
2
100
Advertisements

Demonstration

CodeChef solution FSQRT  - Finding Square Roots CodeChef solution in C,C++

Previous
CodeChef solution BULLET - Mario and Bullet Codechef solution in C,C++
Next
CodeChef solution CFLOW013 - Valid Triangles Codechef solution in C,C++