暴力简单解法 #include #include #include using namespace std; int main(){ int n; cin>>n; while(n--){ long long int a; cin>>a; for(int i=0;i<1e2;i++){ if(pow(2,i)a){ cout<<"YES"<<endl; break; } if(i1e2-1) cout<<"NO"<<endl; } } return 0; }
By signing up a 追梦算法网 universal account, you can submit code and join discussions in all online judging services provided by us.
Using your 追梦算法网 universal account