@@ -0,0 +1,762 @@
+import java.io.*;%0Aimport java.util.*;%0Aimport java.text.*;%0Aimport java.math.*;%0Aimport java.util.regex.*;%0A%0A/**%0A*   Solution to https://www.hackerrank.com/challenges/sherlock-and-squares%0A*/%0Apublic class Solution %7B%0A%0A    public static void main(String%5B%5D args) %7B%0A        Scanner in = new Scanner(System.in);%0A%0A        int tests = in.nextInt();%0A%0A        for (int i = 0; i %3C tests; i++) %7B%0A            int a = in.nextInt();%0A            int b = in.nextInt();%0A%0A            //summing the amount of integers between the inverse function%0A            //from the next int after f-1(a) to the biggest whole int before f-1(b), plus one%0A            int total = (int)(Math.floor(Math.sqrt(b)) - Math.ceil(Math.sqrt(a)) + 1);%0A%0A            System.out.println(total);%0A        %7D%0A    %7D%0A%7D%0A

Create sherlock-and-squares.java