For this Question: Given a positive number X. Find all Jumping Numbers smaller than or equal to X. 
Jumping Number: A number is called Jumping Number if all adjacent digits in it differ by only 1. All single-digit numbers are considered as Jumping Numbers. For example 7, 8987 and 4343456 are Jumping numbers but 796 and 89098 are not.The first line of the input contains T denoting the number of test cases. Each test case contains a positive number N.

Constraints:
1 <= T <= 50
1 <= N <= 10^8For each test case, print a single line containing all the Jumping numbers less than or equal to N from 1 in increasing orderSample Input:
2
10
50

Sample Output:
1 2 3 4 5 6 7 8 9 10
1 2 3 4 5 6 7 8 9 10 12 21 23 32 34 43 45

Explanation:
Testcase 2: Here, the most significant digits of each jumping number is following increasing order, i.e., jumping numbers starting from 0, followed by 1, then 2 and so on, themselves being in increasing order 2, 21, 23., I have written this Solution Code: #include<bits/stdc++.h>
#define int            long long
#define ll             long long
#define pb          push_back
#define    endl        '\n'
#define pii         pair<int,int>
#define vi          vector<int>
#define all(a)      (a).begin(),(a).end()
#define F           first
#define S           second
#define sz(x)       (int)x.size()
#define hell        1000000007
#define rep(i,a,b)    for(int i=a;i<b;i++)
#define dep(i,a,b)    for(int i=a;i>=b;i--)
#define lbnd        lower_bound
#define ubnd        upper_bound
#define bs          binary_search
#define mp          make_pair
using namespace std;

const int N = 1e2 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9 + 9;

void solve(){
	int t;	cin >> t;
	vector<int> v;
	for(int i = 1; i <= 9; i++)
		v.push_back(i);
	for(int i = 0; i < (int)v.size(); i++){
		int x = v[i]%10;
		if(x-1 >= 0){
			int nx = v[i]*10 + x-1;
			if(nx <= inf)
				v.push_back(nx);
		}
		if(x+1 <= 9){
			int nx = v[i]*10 + x+1;
			if(nx <= inf)
				v.push_back(nx);
		}
	}
	while(t--){
		int n;	cin >> n;
		for(int i = 0; i < v.size(); i++){
			if(v[i] <= n)
				cout << v[i] << " ";
		}
		cout << endl;
	}
}

void testcases(){
	int tt = 1; 
	//cin >> tt;
	while(tt--){
		solve();
	}
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

 		clock_t start = clock();
 	

    testcases();


 		cerr << (double)(clock() - start)*1000/CLOCKS_PER_SEC << " ms: ";
    return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?