Finding Square Roots Codechef Solution

Hello coders, today we are going to solve Finding Square Roots Codechef Solution. Which is a part of Codechef 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

Input:

3
10
5
10000

Output:

3
2
100

Finding Square Roots CodeChef Solution in Python

T = int(input())
while T > 0:
   n = int(input())
   sqrt = n ** 0.5
   sqrt_root = round(sqrt)
   print(sqrt_root)
   T = T - 1

 Finding Square Roots CodeChef Solution in CPP

#include <iostream>
#include <math.h>
using namespace std;
int main(){
	int a;
	cin >> a;
	while (a--){
		long b;
		cin >> b;
		cout << int(sqrt(b)) << endl;
	}
}

 Finding Square Roots CodeChef Solution in JAVA

import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int tc = 0; tc < T; tc++) {
			int N = sc.nextInt();
			System.out.println(solve(N));
		}
		sc.close();
	}
	static int solve(int N) {
		int root = (int) Math.ceil(Math.sqrt(N));
		while (root * root > N) {
			root--;
		}
		return root;
	}
}

Disclaimer: The above Problem (Finding Square Roots) is generated by CodeChef but the solution is provided by Chase2learn.This tutorial is only for Educational and Learning purpose.