玲珑杯 I -- I am Two

最新推荐文章于 2017-09-15 18:50:30 发布

know_heng

最新推荐文章于 2017-09-15 18:50:30 发布

阅读量190

点赞数

分类专栏：玲珑杯

本文链接：https://blog.csdn.net/know_heng/article/details/53354124

版权

玲珑杯专栏收录该内容

8 篇文章 0 订阅

订阅专栏

I -- I am Two

Time Limit：1s Memory Limit：64MByte

Submissions：506Solved：198

DESCRIPTION

 Check whether an integer n is a power of 2.

INPUT

    First line contains a single integer T (T<=20) which denotes the number of test cases. For each test case, there is an 32-bit integer N . 
  

OUTPUT

    For each case, output the "Yes" or "No" in a single line. 
  

SAMPLE INPUT

3138

SAMPLE OUTPUT

     YesNoYes 
   

SOLUTION

玲珑杯”ACM比赛 Round #5

水题，打个表判断

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define inf 0x6fffffff
#define LL long long
using namespace std;
LL a[50];
int main(){
    int t;
    cin>>t;
    a[0]=1;
    for(int i=1;i<=31;i++){
        a[i]=a[i-1]*2;
    }
    while(t--){
        int n,k=0;
        cin>>n;
        for(int i=0;i<=30;i++){
            if(a[i]==n)k=1;
        }
        if(k)cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
    }
    return 0;
}