For this Question: Yogi and Dharam are playing a game in which one has to solve the problem in order to get out of the room. Dharam goes first and Yogi gave him a problem. Since Dharam is having problem solving it, your task is to solve the problem for him.

Problem:-
Given a range from A to B your task is to count the numbers in which the difference between adjacent digits is not more than one.The first line of input contains a single integer T. The next T lines contain two space- separated integers each containing values of A and B.

Constraints:-
1 <= T <= 100
1 <= A, B <= 1000000000000For each test case print the count of numbers in the range [A, B] such that the difference between adjacent digits is not more than one.Sample Input:-
2
10 30
1 10

Sample Output:-
6
10

Explanation:-
10, 11, 12, 21, 22, 23
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
  public static int count =0;
  public static void solve(long a ,long b,long number){
    if(number>b){
      return;
    }
    if(number>=a && number <=b){
      count++;
    }
    long last_digit =number % 10;
    number *=10;
    if(last_digit !=0){
      solve(a,b,number+(last_digit-1));
    }
    if(last_digit !=9){
      solve(a,b,number+(last_digit+1));
    }
    solve(a,b,number+(last_digit));
  }

    public static void main (String[] args) {

                      Scanner sc = new Scanner(System.in);
                      int t = sc.nextInt();
                      while(t-->0){
                        long a = sc.nextLong();
                        long b =sc.nextLong();
                        count =0;
                        for(long i=1l ; i<=9l ;i++){
                          solve(a,b,i);
                        }
                        System.out.println(count);
                      }
    }
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?