#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<ctime>
#include<iostream>
#include<queue>
#include<vector>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long ll;
vector<int>::const_iterator it;
#define L ch[rt][0]
#define R ch[rt][1]
const int maxn = 511;
const int N = 411111;
int main() {
ios::sync_with_stdio(false);
int n;
while(cin>>n)
{
if(n&(n-1))
cout<<"NO"<<endl;
else
cout<<"YES"<<endl;
}
return 0;
}
POJ 3372 —— Candy Distribution
最新推荐文章于 2019-04-24 21:22:43 发布