For this Question: Chef and Chefina are playing a game, Chef asks Chefina whether the ith bit is set in the binary representation of the number. Chefina knows how to do it but she is taking quite a lot of time. You are Chefina's friend so help her out of this situation.The first line of the input contains the test case value, T.
Next T lines contain two values N and K, i. e the number N and the Kth bit.

<b>Constraints:</b>
1 &le; T &le; 10<sup>5</sup>
1 &le; N &le; 10<sup>18</sup>
1 &le; K &le; 61Print "SET" if the Kth bit is set and "NOT SET" if it's not.Sample Input 
2
2 1
1 1

Sample Output
NOT SET
SET

Explanation
2's binary representation : 10 hence the first bit is 0 which is not set
1's binary representation : 1 hence the first bit is 1 which is set, I have written this Solution Code: #include <bits/stdc++.h>

using namespace std;

#define int long long

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 2351
#endif

#define int long long

int32_t main() {
    int tt;
    cin >> tt;
    while (tt--) {
        int n, k;
        cin >> n >> k;
        if (n & (1 << (k - 1)))
            cout << "SET\n";
        else
            cout << "NOT SET\n";
    }
    return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?