For this Question: Given a number 'N'. The task is to find the Nth number whose each digit is a prime number(<10) i.e 2, 3, 5, 7. In other words you have to find nth number of this sequence : 2, 3, 5, 7, 22, 23 ,.. and so on.The first line contains a single integer T i.e. the number of test cases. The first and only line of each test case consists of a single integer N. 

Constraints:
1 <= T <= 100
1 <= N <= 100000For each testcase print the nth number of the given sequence made of prime digits in a new line.Input:
2
10
21

Output:
33
222

Explanation:
Testcase 1: 10th number in the sequence of numbers whose each digit is prime is 33.
Testcase 2: 21th number in the sequence of numbers whose each digit is prime is 222., I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
void nthprimedigitsnumber(long long n)
{
    long long len = 1;

    long long prev_count = 0;
    while (true) {
        long long curr_count = prev_count + pow(4, len);

      
        if (prev_count < n && curr_count >= n)
            break;

        len++;

        prev_count = curr_count;
    }


    for (int i = 1; i <= len; i++) {
        for (long long j = 1; j <= 4; j++) {
            if (prev_count + pow(4, len - i) < n)
                prev_count += pow(4, len - i);

            else {
                if (j == 1)
                    cout << "2";
                else if (j == 2)
                    cout << "3";
                else if (j == 3)
                    cout << "5";
                else if (j == 4)
                    cout << "7";
                break;
            }
        }
    }
    cout << endl;
}

int main(){

     int t;
     cin>>t;
while(t--){
long long n;
cin>>n;
  nthprimedigitsnumber(n);

}
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not?