For this Question: Given an integer N, print the count of all numbers with unique digits, x, where 0 <= x < 10^N.First line contains a single integer N.

Constraints:
0 <= N <= 8Print the count of all numbers with unique digits, xSample Input 1:
2
Sample Output 1:
91

Explanations:
The answer should be the total numbers in the range of 0 ≤ x < 100, excluding 11, 22, 33, 44, 55, 66, 77, 88, 99., I have written this Solution Code: import java.util.*;
class Main{
    public static void main(String args[]){
	Scanner sc=new Scanner (System.in);
    int n;
    n=sc.nextInt();
	System.out.println(countNumbersWithUniqueDigits(n));
	}
    public static int countNumbersWithUniqueDigits(int n) {
         return recursion(n,0,new boolean[10]);
    }
    public static int recursion(int n,int curr,boolean[] vis)
    {
        if(curr == n)
            return 1;
        int res = 1;
        for(int i=(curr == 0 ? 1 : 0);i<=9;i++)
        {
            if(vis[i])
                continue;
            vis[i] = true;
            res+=recursion(n,curr+1,vis);
            vis[i] = false;
        }
        return res;
    }
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?