HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Sections > Unsorted > problem:


50967 - Finding Square Roots

Section problems

• 50963 - Append Two Arrays
• 50893 - Print All Numbers
• 50968 - Number of Letters
• 50888 - Extracting Digits
• 50969 - Chef and Feedback
• 50962 - Find the Character
• 50974 - Area of the circle
• 50905 - Convert KPH to MPH
• 50967 - Finding Square Roots
• 50960 - Number of Heart Beats
• 50953 - ASCII Codes - Reverse
• 50885 - Calculate the Average
• 50887 - Average of Test Scores
• 50904 - Print All Prime Numbers
• 50895 - Hours Minutes and Seconds
• 50902 - Translate Score into Grade
• 50938 - Translate Score into Grade

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.

Finding Square Roots

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 T contains an integer N whose square root needs to be computed.

Output

For each line of input output the square root of the input integer.

Constraints

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

 

Sample Input1:

Sample Input2:

3

10

5

10000

1

9

Sample Output2:

Sample Output2:

3

2

100

3

 

Для отправки решений необходимо выполнить вход.

www.contester.ru