| | 1. 题目:请编写一个c函数,该函数给出一个字节中被置为1的位的个数 #include <stdio.h>
int num(int a)
{
int i;
int count = 0;
int temp ;
for(i = 0; i < 8; i++)
{
temp = a % 2;
a /= 2;
if(temp == 1)
{
count++;
}
}
return count;
}
int main()
{
int n;
int a;
char ch;
printf("enter a byte:\n");
scanf("%c", &ch);
a = ch;
n = num(a);
printf("this byte has %d '1'\n", n);
return 0;
}
| |
| | 2. 题目:输入一个整数a,再输入两个整数p1,p2(p1,p2<32),输出该整数的二进制表示方法中从右端开始的p1到p2位. #include <stdio.h>
void func(long n, int p1, int p2)
{
int i;
for(i = 1 << (p1 - 1); i < (1 << p2); i <<= 1)
{
if(n & i)
{
printf("1");
}
else
{
printf("0");
}
}
}
int main()
{
long n;
int p1, p2;
printf("enter a number and p1 p2(p1 < p2 < 32):\n");
scanf("%ld %d %d", &n, &p1, &p2);
func(n, p1, p2);
printf("\n");
return 0;
}
| |
| | 3. 题目:输入一个整数a,再输入两个整数p1,p2(p1,p2<32),将该整数的二进制表示方法中从右端开始的p1到p2位取反后输出
#include <stdio.h>
void func(long n, int p1, int p2, int a[])
{
int i;
int j = 0;
int tmp = 0;
for(i = 1 << (p1 - 1); i < 1 << p2; i <<= 1)
{
tmp = n & i;
if(tmp)
{
a[j] = 0;
}
else
{
a[j] = 1;
}
j++;
}
}
void display(int a[], int p1, int p2)
{
int i;
for(i = 0; i <= (p2 - p1); i++)
{
printf("%d", a[i]);
}
printf("\n");
}
int main()
{
long n;
int p1, p2;
int a[32]= {0};
printf("enter a number and p1 p2(p1 < p2 < 32):\n");
scanf("%ld %d %d", &n, &p1, &p2);
func(n, p1, p2, a);
display(a, p1, p2);
return 0;
}
| |
| | 4. 题目:输入一个整数a,再输入两个整数p(p<32),v(0|1),将该整数a的p位设置为v,输出修改后的该整数的二进制表示.
#include <stdio.h>
int figure(int n)
{
int num = 0;
while(n)
{
n /= 2;
num++;
}
return num;
}
void func(long *n, int p, int v)
{
int mask;
if(v == 0)
{
mask = ~(1 << (p - 1));
*n = *n & mask;
}
else
{
mask = 1 << (p - 1);
*n = *n | mask;
}
}
void reverse(long *n, int b[])
{
int tmp;
int i;
int j = 0;
for(i = 1; i < 1 << *n; i <<= 1)
{
tmp = *n & i;
if(tmp)
{
b[j] = 1;
}
else
{
b[j] = 0;
}
j++;
}
}
void display(int a, int b[])
{
int i;
for(i = a - 1; i >= 0; i--)
{
printf("%d", b[i]);
}
printf("\n");
}
int main()
{
long n;
int a;
int p;
int v;
int b[32] = {0};
printf("enter a number and p(p < 32) and v(0/1):\n");
scanf("%ld %d %d", &n, &p, &v);
a = figure(n);
func(&n, p, v);
reverse(&n, b);
display(a, b);
return 0;
}
| |
| | 5. 题目:输入一个32位的整数a,使用按位异或^运算,生成一个新的32位整数b,使得该整数b的每一位等于原整数a中该位左右两边两个bit位的异或结果 提示:0 ^ 0 = 0; 1 ^ 1 = 0; 0 ^ 1 = 1; 1 ^ 0 = 1;
#include <stdio.h>
int func(long a)
{
long b = 0;
int i;
for(i = 0; i < 32; i++)
{
if((i == 0) || (i == 31))
{
b += ((a >> i) & 1) << i;
}
else
{
b += ((a >> (i - 1) & 1) ^ (a >> (i + 1) & 1) ) << i;
}
}
return b;
}
void display(long a)
{
int tmp;
int i;
for(i = 31; i >= 0; i--)
{
tmp = (a >> i) & 1;
if(tmp)
{
printf("1");
}
else
{
printf("0");
}
}
printf("\n");
}
int main()
{
long a;
long b;
printf("enter a 32 bit numbers:\n");
scanf("%ld", &a);
b = func(a);
display(a);
display(b);
return 0;
}
| |
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
