11.23位运算1,2

#include <stdio.h>


void num_of_byte_1(char ch)
{
int i;
int k = 0;
int count = 0;


for(i = 0; i < 8; i++ )
{
k = ch & 1;
ch = ch >> 1;


if(k == 1)
{
count++;
}
}
printf("number = :%d\n",count);



}
int main()
{
char ch;
printf("please input a byte:");
scanf("%c",&ch);
num_of_byte_1(ch);


    return 0;

}

#include <stdio.h>


int output_num_p1top2(int n,int p1,int p2,int arr[])
{
int i;
int j;
int a;
int temp = 0;


for(i = p1 - 1; i <= p2; i++)
{
temp = (n >> i) & 1;
arr[i] = temp;
i++;
}
for(j = (p2 - p1); j >= 0; j--)
{
printf("%d",arr[j]);
}
printf("\n");
}


int main()
{
int n;
int p1;
int p2;
int arr[32] = {0};
printf("input a num:");
scanf("%d",&n);
printf("input p1 and p2(p1 < p2):");
scanf("%d %d",p1,p2);
output_num_p1top2(n,p1,p2,arr);


    return 0;
}