题目:输入一个32位的整数a,使用按位异或^运算,生成一个新的32位整数b,使得该整数b的每一位等于原整数a中该位左右两边两个bit位的异或结果
提示:0 ^ 0 = 0; 1 ^ 1 = 0; 0 ^ 1 = 1; 1 ^ 0 = 1;
<span style="font-size:18px;">#include <stdio.h>
int creat_bit(int n)
{
int b;
int num[32];
int i;
b = 0;
for(i = 0; i < 32; i++)
{
if(i == 0)
{
if(((n >> (i + 1)) & 1) ^ ((n >> 31) & 1))//鍒ゆ柇n鐨?2浣嶅拰绗?浣嶅紓鎴栨槸鍚︿负涓€
{
b = b | (1 >> 0);//灏哹鐨勭涓€浣嶇疆1
num[i] = 1;
}
else
{
num[i] = 0;
}
}
if(i == 31)
{
if(((n >> (i - 1)) & 1) ^ ((n >> 0) & 1))//鍒ゆ柇n鐨?1浣嶄笌1浣嶅紓鎴栨槸鍚︿负涓€
{
b = b | (1 << 31);//灏哹鐨?2浣嶇疆涓€
num[i] = 1;
}
else
{
num[i] = 0;
}
}
if(0 < i < 31)
{
if(((n >> (i - 1)) & 1) ^((n >> (i + 1)) & 1))//鍒ゆ柇n鐨刬-1浣嶅拰i+1浣嶅紓鎴栨槸鍚︿负涓€
{
b = b | (1 << i);//灏哹鐨刬+1浣嶇疆涓€
num[i] = 1;
}
else
{
num[i] = 0;
}
}
}
for(i = 31; i >= 0; i--)//杈撳嚭num
{
printf("%d",num[i]);
}
printf("\n");
return b;
}
int main()
{
int m;
int n;
printf("input a integer:");
scanf("%d",&n);
m = creat_bit(n);//灏嗚繑鍥炲€奸檮缁檓;
printf("b is %d\n",m);//鎵撳嵃b鐨勫€?
return 0;
}
</span>
<span style="font-size:18px;">#include <stdio.h>
int creat_bit(int n)
{
int b;
int num[32];
int i;
b = 0;
for(i = 0; i < 32; i++)
{
if(i == 0)
{
if(((n >> (i + 1)) & 1) ^ ((n >> 31) & 1))//鍒ゆ柇n鐨?2浣嶅拰绗?浣嶅紓鎴栨槸鍚︿负涓€
{
b = b | (1 >> 0);//灏哹鐨勭涓€浣嶇疆1
num[i] = 1;
}
else
{
num[i] = 0;
}
}
if(i == 31)
{
if(((n >> (i - 1)) & 1) ^ ((n >> 0) & 1))//鍒ゆ柇n鐨?1浣嶄笌1浣嶅紓鎴栨槸鍚︿负涓€
{
b = b | (1 << 31);//灏哹鐨?2浣嶇疆涓€
num[i] = 1;
}
else
{
num[i] = 0;
}
}
if(0 < i < 31)
{
if(((n >> (i - 1)) & 1) ^((n >> (i + 1)) & 1))//鍒ゆ柇n鐨刬-1浣嶅拰i+1浣嶅紓鎴栨槸鍚︿负涓€
{
b = b | (1 << i);//灏哹鐨刬+1浣嶇疆涓€
num[i] = 1;
}
else
{
num[i] = 0;
}
}
}
for(i = 31; i >= 0; i--)//杈撳嚭num
{
printf("%d",num[i]);
}
printf("\n");
return b;
}
int main()
{
int m;
int n;
printf("input a integer:");
scanf("%d",&n);
m = creat_bit(n);//灏嗚繑鍥炲€奸檮缁檓;
printf("b is %d\n",m);//鎵撳嵃b鐨勫€?
return 0;
}
</span>