玲珑杯”ACM比赛 Round #5 --2的幂次方
2016-11-27 10:28
429 查看
1064 - I am Two
Time Limit:1s Memory Limit:64MByte
Submissions:522Solved:205
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
code:
Time Limit:1s Memory Limit:64MByte
Submissions:522Solved:205
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
code:
#include<cstdio> #include<algorithm> using namespace std; int main() { int t,n; scanf("%d",&t); while(t--) { scanf("%d",&n); if(n>0&&(n&(n-1))==0) printf("Yes\n"); else printf("No\n"); } return 0; }
相关文章推荐
- “玲珑杯”ACM比赛 Round #5 H -- Variance 简单树状数组
- “玲珑杯”ACM比赛 Round #5------I am Two
- “玲珑杯”ACM比赛 Round #5 B -- Private Value【STL-map】
- “玲珑杯”ACM比赛 Round #5 I -- I am Two【位运算判断2的幂】
- “玲珑杯”ACM比赛 Round #5 H -- Variance(线段树+方差)
- 玲珑杯”ACM比赛 Round #5
- “玲珑杯”ACM比赛 Round #5 C -- Coco(递归)
- “玲珑杯”ACM比赛 Round #18 A -- 计算几何你瞎暴力
- “玲珑杯”ACM比赛 Round #18 C -- 图论你先敲完模板(dp)
- 玲珑杯”ACM比赛 Round #19 A simple math problem
- “玲珑杯”ACM比赛 Round #21【石子合并O(n^2)】
- “玲珑杯”ACM比赛 Round #4 A -- chess play 【记忆模拟】
- 玲珑杯”ACM比赛 Round #4 G -- See car【Set】
- “玲珑杯”ACM比赛 Round #11
- “玲珑杯”ACM比赛 Round #23 C -- 你居然不吃巧克力(思路)
- “玲珑杯”ACM比赛 Round #13 B -- 我也不是B(二分排序)
- “玲珑杯”ACM比赛 Round #16 Down the Rabbit Hole
- “玲珑杯”ACM比赛 Round #18 B -- 数论你还会快速幂【规律】
- “玲珑杯”ACM比赛 Round #4 G -- See car【多种容器的运用】
- “玲珑杯”ACM比赛 Round #4 F -- My-graph【图的同构(构造)】