Program to delete duplicates from a link list

Finding Square Roots | Codechef solution

Problem of Finding Square Roots | Codechef solution:-

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 of Finding Square Roots | Codechef solution

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 of Finding Square Roots | Codechef solution

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

Input:
3
10
5
10000

Output:
3
2
100

Code:-

#include <bits/stdc++.h>
using namespace std;

int main() 
{
    int t;
    cin>>t;
    while(t--)
    {
       int n;
       cin>>n;
       int a=sqrt(n);
       cout<<a<<endl;
     }
    return 0;
}

 

Recommended Post:

Leave a Reply

Your email address will not be published.