COJ 1059 - Numeric Parity 位操作
2024-09-19 20:25:36
非常好玩的一道题。能够熟悉下位操作实现和玩一玩bitset这个容器
Description
We define the parity of an integer N as the sum of the bits in binary representation computed modulo two. As an example, the number 21 = 10101 has three 1s in its binary representation so it has parity 3 (mod 2), or 1.
In this problem you have to calculate the parity of an integer 1 <= I <= 2147483647 (2^31-1). Then, let start to work...
In this problem you have to calculate the parity of an integer 1 <= I <= 2147483647 (2^31-1). Then, let start to work...
Input specification
Each line of the input has an integer I and the end of the input is indicated by a line where I = 0 that should not be processed.
Output specification
For each integer I in the input you should print one line in the form "The parity of B is P (mod 2)." where B is the binary representation of I.
Sample input
1
2
10
21
0
Sample output
The parity of 1 is 1 (mod 2).
The parity of 10 is 1 (mod 2).
The parity of 1010 is 2 (mod 2).
The parity of 10101 is 3 (mod 2).
使用bitset来实现。注意bitset的高低为存储顺序,是底位到高位。索引i右0到大的:
void NumericParity()
{
int n = 0;
bitset<32> bi;
while (cin>>n && n)
{
bi = n;
cout<<"The parity of ";
bool flag = false;
for (int i = bi.size() - 1; i >= 0 ; i--)
{
flag |= bi.test(i);
if (flag) cout<<bi[i];
}
cout<<" is "<<bi.count()<<" (mod 2).\n";
}
}
自家自制的位操作:
static bool biNum[32]; int intTobi(int n)
{
int i = 0, c = 0;
while (n)
{
c += n % 2;
biNum[i++] = n % 2;
n >>= 1;
}
return c;
} void NumericParity2()
{
int n = 0;
while (cin>>n && n)
{
fill(biNum, biNum+32, false);
cout<<"The parity of ";
int c = intTobi(n);
bool flag = false;
for (int i = 31; i >= 0 ; i--)
{
flag |= biNum[i];
if (flag) cout<<biNum[i];
}
cout<<" is "<<c<<" (mod 2).\n";
}
}
最新文章
- 封装自己的DB类(PHP)
- adb push和pull使用
- 正常月报表年初未分配利润修改backup
- Outer Join Query Over Dblink Can Fail With ORA-904 (Doc ID 730256.1)
- centos7 安装及配置
- systemctl 启动成功却提示没有权限(解决)
- SQL - 批量修改表中所有行数据某字段的部分内容
- 为DEDE织梦添加XMl网站地图
- flex 图片旋转(解决公转和自转问题)
- 【windows核心编程】 第六章 线程基础
- Python之路,Day8 - Socket编程进阶
- BZOJ 3237([Ahoi2013]连通图-cdq图重构-连通性缩点)
- jquery 自动调整图片大小
- Memcached&#183;Redis缓存的基本操作
- webServices接口开发过程中项目启动遇到的错误org.xml.sax.SAXParseException; lineNumber: 20; columnNumber: 422; schema_reference.4: Failed to read schema document &#39;http://www.springframework.org/schema/beans/spring-bean
- HTML+JS实现网站公告信息滚动显示
- 解决invalid record found in VCF4 file (at least 8 tab-delimited fields expected)问题,批量修改空格改为制表格格式
- opencv学习之路(18)、霍夫变换
- ROS 进阶学习笔记(12) - Communication with ROS through USART Serial Port
- POJ2229 Sumsets