@@ -0,0 +1,805 @@
+package java_problems.beginner;%0D%0A%0D%0Aimport java.util.Scanner;%0D%0A%0D%0A/*%0D%0A * Input: %0D%0A * The first line of the input contains an integer T, the number of test cases.%0D%0A * T lines follow. Each T contains an integer N whose square root needs to be%0D%0A * computed.%0D%0A * %0D%0A * Output: %0D%0A * For each line of input output the square root of the input integer.%0D%0A * %0D%0A * Constraints: %0D%0A * 1 %3C= T %3C= 20%0D%0A * 1 %3C= N %3C= 10000%0D%0A * %0D%0A * Input:%0D%0A * 3%0D%0A * 10%0D%0A * 5%0D%0A * 10000%0D%0A * %0D%0A * Output:%0D%0A * 3%0D%0A * 2%0D%0A * 100%0D%0A */%0D%0Apublic class FindingSquareRoots %7B%0D%0A%0D%0A%09public static void main(String%5B%5D args) %7B%0D%0A%09%09%0D%0A%09%09Scanner sc = new Scanner(System.in);%0D%0A%09%09int numCases = Integer.parseInt(sc.nextLine());%0D%0A%09%09for (int i = 0; i %3C numCases; i++) %7B%0D%0A%09%09%09int num = sc.nextInt();%0D%0A%09%09%09System.out.println((int) Math.sqrt(num));%0D%0A%09%09%7D%0D%0A%09%09sc.close();%0D%0A%09%7D%0D%0A%7D

Add FindingSquareRoots