Parity 进制转换

该问题要求计算1到2^31-1之间的整数在二进制表示下的奇偶性,即计算二进制表示中1的个数对2取模的结果。给出的C++代码通过递归函数实现进制转换并统计1的个数,然后输出结果。
摘要由CSDN通过智能技术生成

We define the parity of an integer n as the sum of the bits in binary representation computed modulotwo.

 As an example, the number 21 = 101012 has three 1s in its binary representation so it has parity

3(mod2), or 1.

In this problem you have to calculate the parity of an integer 1 ≤ I ≤ 2147483647.

Input

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

For each integer I in the inputt you should print a line ‘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).



#include<bits/stdc++.h>
usin

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值