HackerRank : Sherlock And Squares

Watson gives two integers (A$A$ and B$B$) to Sherlock and asks if he can count the number of square integers between A$A$ and B$B$ (both inclusive).

Note: A square integer is an integer which is the square of any integer. For example, 1, 4, 9, and 16 are some of the square integers as they are squares of 1, 2, 3, and 4, respectively.

Input Format
The first line contains T$T$, the number of test cases. T$T$ test cases follow, each in a new line.
Each test case contains two space-separated integers denoting A$A$ and B$B$.

Output Format
For each test case, print the required answer in a new line.

Constraints
1≤T≤100$1\le T\le 100$
1≤A≤B≤109$1\le A\le B\le {10}^9$

Sample Input

2
3 9
17 24

Sample output

2
0

Explanation
Test Case #00: In range [3,9]$[3,9]$, 4$4$ and 9$9$ are the two square numbers.
Test Case #01: In range [17,24]$[17,24]$, there are no square numbers.

Code:

public class SherlockAndSquares {
 public static void main(String[] args) {
  Scanner in  = new Scanner(System.in);
  int t = in.nextInt();
  
  for(int i=0;i<t;i++){
   long a = in.nextLong();
   long b = in.nextLong();
   Double x = Math.sqrt(a);
   Double y = Math.sqrt(b);
   long xL = x.longValue();
   long xY = y.longValue();
   long count = 0;
   for(long j = xL; j<=xY; j++) {
    if((j * j) >=a && (j * j) <=b ){
     count++;
    }
   }
   System.out.println(count);
  }
  in.close();
 }
}