作业社区
探索学习新天地，共享知识资源！
慕运维8597106 的学生作业：
#include struct bit { unsigned int a:6; unsigned int b:12; unsigned int c:4; }; int main(int argc, const char *argv[]) { printf("sizeof(struct bit) = %d\n",sizeof(struct bit)); return 0; } 结果 linux@linux:~/learn/chapter3/2$ ./a.out sizeof(struct bit) = 4
+173
慕运维8597106 的学生作业：
#include enum COLOR { red = 1, green = 2, yellow, blue, black, }; int main() { int color; printf("please input a color:"); scanf("%d",&color); switch(color) { case red: printf("red\n"); break; case green: printf("green\n"); break; case yellow: printf("yellow\n"); break; case blue: printf("blue\n"); break; case black: printf("black\n"); break; } } 结果： linux@linux:~/learn/chapter3/2$ ./a.out please input a color:3 yellow linux@linux:~/learn/chapter3/2$
+179
慕运维8597106 的学生作业：
#include typedef struct { unsigned char Red; unsigned char Green; unsigned char Blue; }RGB_t; typedef union { RGB_t rgb; unsigned int value; }PIX_t; int main(int argc, const char *argv[]) { PIX_t pix; pix.rgb.Red = 0x11; pix.rgb.Green = 0x22; pix.rgb.Blue = 0x33; printf("address of Red:%p\n",&pix.rgb.Red); printf("address of Green:%p\n",&pix.rgb.Green); printf("address of Blue:%p\n",&pix.rgb.Blue); printf("address of value:%p\n",&pix.value); printf("pix.value = %#x\n",pix.value); return 0; } 【图片】
+177
慕运维8597106 的学生作业：
#include struct student{ char name[20]; int id; int score; }st1 = {"jack",1,100}; int main() { struct student st[3] = { {"rose",2,70}, {"lilei",3,60}, {"hmm",4,50} }; int id; // 1.输出st1整个人的信息 printf("name\tid\tscore\n"); printf("%s\t%d\t%d\n",st1.name,st1.id,st1.score); printf("======================================\n"); // 2.输出st中3个的信息 for(int i = 0;i < sizeof(st)/sizeof(st[0]);i++) { printf("%s\t%d\t%d\n",st[i].name,st[i].id,st[i].score); } printf("======================================\n"); // 3.判断输入的id是否存在 printf("please input id:"); scanf("%d",&id); struct student *target = NULL; for(int i = 0;i < sizeof(st)/sizeof(st[0]);i++) { if(st[i].id == id) { target = &st[i]; break; } } if(NULL == target){ printf("no exist\n"); }else{ printf("查询到name=%s\n",target->name); } } 【图片】
+180
慕运维8597106 的学生作业：
head.h #ifndef __HEAD_H__ #define __HEAD_H__ extern int add(int x,int y); extern int sub(int x,int y); extern int mul(int x,int y); extern int div(int x,int y); #endif calc.c #include #include "head.h" int add(int x,int y) { return x + y; } int sub(int x,int y) { return x - y; } int mul(int x,int y) { return x * y; } int div(int x,int y) { return x / y; } main.c #include #include "head.h" int main(int argc, const char *argv[]) { int result = 0; int a = 10,b = 5; result = add(10,5); printf("a + b = %d\n",result); result = sub(10,5); printf("a - b = %d\n",result); result = mul(10,5); printf("a * b = %d\n",result); result = div(10,5); printf("a / b = %d\n",result); return 0; }
+178
慕运维8597106 的学生作业：
#include #include extern char* design_array(); extern void input_array(char *p,int* len); extern void output_array(char *p,const int len); extern int cout_space(char *p); int main() { char *p = NULL; int num = 0; p = design_array(); input_array(p,&num); output_array(p,num); int ret = cout_space(p); printf("统计有%d个空格",ret); return 0; } char* design_array() { static char a[100] = {0}; return a; } void input_array(char *p,int* len) { printf("please input string:"); gets(p); *len = strlen(p); } void output_array(char *p,const int len) { for(int i = 0;i < len;i++) { printf("%c ",p[i]); } printf("\n"); } int cout_space(char *p) { int count = 0; for(int i = 0;p[i]!='\0';p++) { if(p[i] == 32){ count++; } } return count; }
+185
慕运维8597106 的学生作业：
#include extern void input_array(int* p,const int len); extern void output_array(const int* p,const int len); extern int find_max(const int* p,const int len); int main() { int a[5]; int *p = a; int len = sizeof(a) / sizeof(a[0]); input_array(p,len); output_array(p,len); int max = find_max(p,len); printf("max = %d\n",max); return 0; } void input_array(int* p,const int len) { printf("please input %d numbers:",len); for(int i = 0;i < len;i++) { scanf("%d",&p[i]); } } void output_array(const int *p,const int len) { for(int i = 0;i < len;i++) { printf("%d ",p[i]); } printf("\n"); } int find_max(const int *p,const int len) { int max = 0; for(int i = 0;i < len;i++) { if(i == 0){ max = p[i]; }else { max = p[i] > max ? p[i] : max; } } return max; }
+191