判断二进制半整数_牛客网

 1 #include <iostream>
 2 
 3 using namespace std;
 4 
 5 typedef long long LL;
 6 
 7 LL binaryarray[70]={0};
 8 
 9 void calbin(){
10     binaryarray[0]=2;
11     for(int i=1;i<61;i++){
12         binaryarray[i]=binaryarray[i-1]*2;
13         //cout<<binaryarray[i]<<endl;
14     }
15 }
16 
17 bool judge(LL n){
18     for(int i=0;i<61;i++){
19         for(int j=0;j<61;j++){
20             if(n==(binaryarray[i]+binaryarray[j])){
21                 return true;
22             }
23         }
24     }
25     return false;
26 }
27 
28 int main()
29 {
30     LL T,N;
31     calbin();
32     cin>>T;
33     while(T--){
34         cin>>N;
35         if(judge(N)){
36             cout<<"YES"<<endl;
37         }else{
38             cout<<"NO"<<endl;
39         }
40     }
41     return 0;
42 }