第一题
#include<stdio.h>
int main(void) {
int ch;
while ((ch = getchar()) != EOF&&ch!='\n') {
if (ch < 'a') {
ch += 32;
}
putchar(ch);
}
printf("\nbye!");
return 0;
}
第二题
里面大小写字母转换没懂什么意思所以直接大转小,小转大。
#include<stdio.h>
#include<stdlib.h>
#include<ctype.h>
int main()
{
int ch;
while ((ch = getchar()) != EOF) {
if (ch >= 'a' && ch <= 'm' || ch >= 'A' && ch <= 'M')
ch += 13;
else if (ch >= 'n' && ch <= 'z' || ch >= 'N' && ch <= 'Z')
ch -= 13;
if (ch >= 'A' && ch <= 'Z')
ch = tolower(ch);
else if (ch >= 'a' && ch <= 'z')
ch = toupper(ch);
putchar(ch);
}
return 0;
}
第三题
#include<stdio.h>
#include <limits.h>
unsigned int reverse_bits(unsigned int value);
int main(void) {
unsigned int value;
scanf("%u", &value);
printf("%u\n", reverse_bits(value));
return 0;
}
unsigned int reverse_bits(unsigned int value) {
unsigned int res[32];
int x = 1,count=32;
int i, j = count - 1;
unsigned int sum = 0;
for (i = 0; i < count; i++) {
res[i] = x & value>>i;
sum =sum+(res[i] << j--);
}
return sum;
}
第四题
C语言位运算C primer plus这本书的时候直接看了一下它的符号运用就直接跳过了,因为我也是刚学c后面大概会很少用到。感觉有点问题说不上来,如果有人发现说一下,谢谢.
#include<stdio.h>
#include<stdbool.h>
void set_bit(char bit_array[], unsigned bit_number);
void clear_bit(char bit_array[], unsigned bit_number);
void assign_bit(char bit_array[], unsigned bit_number, int value);
int test_bit(char bit_array[], unsigned bit_number);
int main(void) {
unsigned int a,value;
char bit_array[1] = { 0xff };
while (scanf("%d %d", &a,&value) == 2&&a!=0) {
if (a > 8 || a < 0)
continue;
set_bit(bit_array, a);
clear_bit(bit_array, a);
assign_bit(bit_array,a,value);
printf("%d\n", test_bit(bit_array, a));
puts("You can continue typing(quit 0)");
}
return 0;
}
void set_bit(char bit_array[], unsigned bit_number) {
int x = 1;
int res[8] = { 0 };
*bit_array |= x << bit_number - 1;
for (int i = 0; i < 8; i++) {
res[i] = 1 & *bit_array >> i;
printf("%d\t", res[i]);
}
putchar('\n');
return;
}
void clear_bit(char bit_array[], unsigned bit_number) {
int x = 1;
*bit_array &= ~(x << bit_number - 1);
int res[8] = { 0 };
for (int i = 0; i < 8; i++) {
res[i] = 1 & *bit_array >> i;
printf("%d\t", res[i]);
}
putchar('\n');
return;
}
void assign_bit(char bit_array[], unsigned bit_number, int value) {
int res[8] = {0};
if (value == 0) {
*bit_array &= ~(1 << bit_number - 1);
}
else {
*bit_array |= 1 << bit_number - 1;
}
for (int i = 0; i < 8; i++) {
res[i] = 1 & *bit_array >> i;
printf("%d\t", res[i]);
}
putchar('\n');
return;
}
int test_bit(char bit_array[], unsigned bit_number) {
if (*bit_array &1 << bit_number - 1) {
return 1;
}
else return 0;
}
第五题
#include <stdio.h>
int store_bit_field(int original_value, int value_to_store,
unsigned starting_bit, unsigned ending_bit);
int main(void) {
printf("0x%x\n", store_bit_field(0x0, 0x1, 4, 4));
printf("0x%x\n", store_bit_field(0xffff, 0x123, 15, 4));
printf("0x%x\n", store_bit_field(0xffff, 0x123, 13, 9));
}
int store_bit_field(int original_value, int value_to_store,
unsigned starting_bit, unsigned ending_bit) {
unsigned int mask = 0;
int nums = ending_bit;
int bitvalue = starting_bit - ending_bit;
int value=1;
value <<= ending_bit;
while (nums <= starting_bit) {
mask |= value;
value <<= 1;
nums++;
}
original_value &= ~mask;
value_to_store <<= ending_bit;
value_to_store &= mask;
value_to_store |= original_value;
return value_to_store;
}