1.写一个函数返回参数二进制中 1 的个数
比如: 15 0000 1111 4 个 1
程序原型:
int count_one_bits(unsigned int value)
{
// 返回 1的位数
}
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
int count_one_bits(unsigned int value)
{
int count = 0;
while (value != 0)
{
if (value % 2 == 1)
count++;
value = value >> 1;
}
return count;
}
int main()
{
int value = 0;
scanf("%d", &value);
int ret = count_one_bits(value);
printf("%d\n", ret);
system("pause");
return 0;
}
2.获取一个数二进制序列中所有的偶数位和奇数位,
分别输出二进制序列。
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
int main()
{
int num = 0;
int j = 0;
int i = 0;
scanf("%d", &num);
printf("奇数位:\n");
for (j = 30; j >= 0; j -= 2)
{
printf("%d", (num>>j)&1);
}
printf("\n偶数位:\n");
for (i = 31; i > 0; i -= 2)
{
printf("%d", (num>>i)&1);
}
printf("\n");
system("pause");
return 0;
}
3.编程实现:
两个int(32位)整数m和n的二进制表达中,有多少个位(bit)不同?
输入例子:
1999 2299
输出例子:7
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
int count_bit_one(int n)
{
int count = 0;
while (n != 0)
{
count++;
n = n&(n - 1);
}
return count;
}
int main()
{
int m = 0;
int n = 0;
int s = 0;
int ret = 0;
scanf("%d%d", &m, &n);
s = m^n;
ret = count_bit_one(s);
printf("%d\n", ret);
system("pause");
return 0;
}