For this Question: Given a number N in decimal form, you have to cyclically rotate left the binary representation of number N in 31 bit, you get the maximum number that can be formed.
Note:- All the leftover bits in binary representation of N are filled with zeroes i.e binary representation of 4 will be :- 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0The input contains T, denoting the number of testcases. Each testcase contains a number <b>N</b>.

Constraints:
1 <= T <= 100
1 <= N <= (2^32)-1For each testcase in new line print the maximum number formed.Input:
2
1
0

Output:
2147483648
0

Explanation:
Test case 1:- The binary representation of 1 is 0 0 0 . . . . . 1 when we make a cyclic shift to the left the number will become 1 0 0 0 0.......... 0 0 0 0. which is the maximum number that can be formed.
Test case 2:- The binary representation of 0 is 0, even if we left shift its binary numbers we still get 0 for that., I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;

#define pu push_back
#define fi first
#define se second
#define mp make_pair
#define int long long
#define pii pair<int,int>
#define mm (s+e)/2
#define all(x) x.begin(), x.end()
#define For(i, st, en) for(int i=st; i<en; i++)
#define tr(x) for(auto it=x.begin(); it!=x.end(); it++)
#define fast std::ios::sync_with_stdio(false);cin.tie(NULL);
#define sz 200000
signed main()
{
	
		int t;
		cin>>t;
        int P[50];
        P[0]=1;
        for(int i=1;i<=35;i++)
        {
        	P[i]=P[i-1]*2LL;
        }
		while(t>0)
		{
			t--;
			deque<int> ss;
			int n;
			cin>>n;
			for(int i=0;i<32;i++)
			{
				int p=n%2LL;
				ss.pu(p);
				n/=2LL;
			}
             int ans=0;
			for(int i=0;i<32;i++)
			{
               int p=0;
               for(int j=0;j<32;j++)
               {
               	p+=P[j]*ss[j];
               }
               ans=max(ans,p);

				ss.push_front(ss[31]);
				ss.pop_back();
			}
			cout<<ans<<endl;



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