/*注意&的使用 num & (num-1) 判断num是否为2的k次方 证明看:http://hi.baidu.com/findthegateopen/blog/item/03e5802e19f1ea301e3089f9.html */ #include <iostream> using namespace std; int main() { int num; while(1 == scanf("%d", &num)) { printf((num & num - 1) ? "NO/n" : "YES/n"); } return 0; }