zoukankan
html css js c++ java
判断一个整数是否是2的n次方
http://blog.csdn.net/amandag/archive/2008/12/06/3461070.aspx
//判断一个整数是否是2的n次方
public
static
bool
IsPower(
int
number)
{
if
(number <= 0)
{
return
false
;
}
if
((number & (number - 1)) == 0)
{
return
true
;
}
return
false
;
}
===================================
public
static
bool
IsPower(
int
number)
{
if
(number <= 0)
{
return
false
;
}
while
(
true
)
{
if
(number == 1)
{
return
true
;
}
//如果是奇数
if
((number & 1) == 1)
{
return
false
;
}
//右移一位
number >>= 1;
}
查看全文
相关阅读:
【BZOJ4444】国旗计划
NOIp模拟赛三十一
[arc086e]snuke line
NOIp模拟赛三十
[agc004f]namori
[agc004d]salvage robot
[agc016b]colorful hats
NOIp模拟赛二十九
[arc082f]sandglass
Oracle性能报告--ASH
原文地址:https://www.cnblogs.com/luluping/p/1677593.html
最新文章
Round Numbers(数位DP)
F(x)(数位DP)
不要62(数位DP)
Codeforces Beta Round #77 (Div. 2 Only)
牛客小白月赛12
Codeforces Beta Round #76 (Div. 2 Only)
Codeforces Beta Round #75 (Div. 2 Only)
Codeforces Beta Round #74 (Div. 2 Only)
Nim
【BZOJ4002】[JLOI2015]有意义的字符串
热门文章
NOIp模拟赛三十四(yxq供题)
【BZOJ4383】[POI2015]pustynia
[agc016e]poor turkeys
[arc082e]ConvexScore
NOIp2018模拟赛三十三
LCT笔记
[arc062e]Building Cubes with AtCoDeer
NOIp2018模拟赛三十二
[arc079f]namori grundy
[agc006f]blackout
Copyright © 2011-2022 走看看