剑指offer——面试题15.1：判断一个数是否为2的整数次方

#include"iostream"
using namespace std;

bool IsTwoPower(int n)
{
    return !((n-1)&n);
}

int main()
{
    int n;
    while(cin>>n)
    {
        if(n==0)
        {
            cout<<"no"<<endl;
            continue;
        }
        if(IsTwoPower(n))
            cout<<"yes"<<endl;
        else
            cout<<"no"<<endl;
    }
    return 0;
}