A. Odd Divisors

C++Java

#include <bits/stdc++.h>
using namespace std;
#define ll              long long int
#define ulli            unsigned long long int
#define li              long int

int main()
{
    int t;
    cin >> t;
    while (t-- > 0)
    {
        long long int n;
        cin >> n;
        if ((n & (n - 1)) != 0)
            cout << "YES" << endl;
        else
            cout << "NO" << endl;
    }
    return 0;
}

import java.util.*;
import java.io.*;

public class Main {
    public static void main(String[] args) {
        FastReader sc = new FastReader();
        int t = sc.nextInt();
        while (t-- > 0) {
            long n = sc.nextLong();
            if ((n & (n - 1)) != 0)
                System.out.println("YES");
            else
                System.out.println("NO");
        }
    }
}

• Time Complexity : O(1)
• Space Complexity : O(1)