实验六
任务四
1 #include <stdio.h> 2 #define N 10 3 4 typedef struct { 5 char isbn[20]; 6 char name[80]; 7 char author[80]; 8 double sales_price; 9 int sales_count; 10 }Book; 11 12 13 void output(Book x[], int n); 14 void sort(Book x[], int n); 15 double sales_amount(Book x[], int n); 16 17 int main() { 18 Book x[N] = {{"978-7-5327-6082-4", "门将之死", "罗纳德.伦", 42, 51}, 19 {"978-7-308-17047-5", "自由与爱之地:入以色列记", "云也退", 49 , 30}, 20 {"978-7-5404-9344-8", "伦敦人", "克莱格泰勒", 68, 27}, 21 {"978-7-5447-5246-6", "软件体的生命周期", "特德姜", 35, 90}, 22 {"978-7-5722-5475-8", "芯片简史", "汪波", 74.9, 49}, 23 {"978-7-5133-5750-0", "主机战争", "布莱克.J.哈里斯", 128, 42}, 24 {"978-7-2011-4617-1", "世界尽头的咖啡馆", "约翰·史崔勒基", 22.5, 44}, 25 {"978-7-5133-5109-6", "你好外星人", "英国未来出版集团", 118, 42}, 26 {"978-7-1155-0509-5", "无穷的开始:世界进步的本源", "戴维·多伊奇", 37.5, 27 55}, 28 {"978-7-229-14156-1", "源泉", "安.兰德", 84, 59}}; 29 printf("图书销量排名(按销售册数): \n"); 30 sort(x,N); 31 output(x,N); 32 33 printf("\n图书销售总额: %.2f\n", sales_amount(x, N)); 34 35 return 0; 36 } 37 38 void output(Book x[], int n) { 39 int i; 40 printf("\n%-20s %-30s %-20s %-10s %-10s\n", "ISBN", "书名", "作者", "售价", "销量"); 41 for (i = 0; i < n; i++) { 42 printf("%-20s %-30s %-20s %-10.2f %-10d\n", 43 x[i].isbn, x[i].name, x[i].author, x[i].sales_price, x[i].sales_count); 44 } 45 } 46 47 void sort(Book x[], int n){ 48 Book temp; 49 int i,j; 50 for( i = 0; i < n-1 ; i++){ 51 for(j = i+1;j<N;j++){ 52 if(x[i].sales_count < x[j].sales_count){ 53 temp = x[i]; 54 x[i] = x[j]; 55 x[j] = temp; 56 } 57 } 58 } 59 } 60 61 double sales_amount(Book x[], int n){ 62 double total = 0.0; 63 int i; 64 for ( i = 0; i < n; i++){ 65 total += x[i].sales_price * x[i].sales_count; 66 } 67 return total; 68 } 69 70 71 72 73 74 75 76 77

任务五
1 #include <stdio.h> 2 3 typedef struct { 4 int year; 5 int month; 6 int day; 7 } Date; 8 9 // 函数声明 10 void input(Date *pd); // 输入日期给pd指向的Date变量 11 int day_of_year(Date d); // 返回日期d是这一年的第多少天 12 int compare_dates(Date d1, Date d2); // 比较两个日期: 13 // 如果d1在d2之前,返回-1; 14 // 如果d1在d2之后,返回1 15 // 如果d1和d2相同,返回0 16 17 void test1() { 18 Date d; 19 int i; 20 21 printf("输入日期:(以形如2025-12-19这样的形式输入)\n"); 22 for(i = 0; i < 3; ++i) { 23 input(&d); 24 printf("%d-%02d-%02d是这一年中第%d天\n\n", d.year, d.month, d.day, 25 day_of_year(d)); 26 } 27 } 28 29 void test2() { 30 Date Alice_birth, Bob_birth; 31 int i; 32 int ans; 33 34 printf("输入Alice和Bob出生日期:(以形如2025-12-19这样的形式输入)\n"); 35 for(i = 0; i < 3; ++i) { 36 input(&Alice_birth); 37 input(&Bob_birth); 38 ans = compare_dates(Alice_birth, Bob_birth); 39 40 if(ans == 0) 41 printf("Alice和Bob一样大\n\n"); 42 else if(ans == -1) 43 printf("Alice比Bob大\n\n"); 44 else 45 printf("Alice比Bob小\n\n"); 46 } 47 } 48 49 int main() { 50 printf("测试1: 输入日期, 打印输出这是一年中第多少天\n"); 51 test1(); 52 53 printf("\n测试2: 两个人年龄大小关系\n"); 54 test2(); 55 } 56 57 void input(Date *pd) { 58 scanf("%d-%d-%d", &pd->year, &pd->month, &pd->day); 59 } 60 61 int day_of_year(Date d){ 62 int i; 63 int days_in_month[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; 64 int total = 0; 65 66 int is_leap = (d.year % 4 == 0 && d.year % 100 != 0) || (d.year % 400 == 0); 67 if(is_leap) { 68 days_in_month[1] = 29; 69 } 70 for(i=0;i<d.month-1;i++){ 71 total += days_in_month[i]; 72 } 73 total += d.day; 74 return total; 75 } 76 77 int compare_dates(Date d1, Date d2){ 78 if (d1.year < d2.year) return -1; 79 if (d1.year > d2.year) return 1; 80 if (d1.month < d2.month) return -1; 81 if (d1.month > d2.month) return 1; 82 if (d1.day < d2.day) return -1; 83 if (d1.day > d2.day) return 1; 84 return 0; 85 //return 已经完成了“立即退出”的功能,完全不需要 break。 86 }

任务六
1 #include <stdio.h> 2 #include <string.h> 3 4 enum Role {admin, student, teacher}; 5 6 typedef struct { 7 char username[20]; 8 char password[20]; 9 enum Role type; 10 } Account; 11 12 13 void output(Account x[], int n); // 输出账户数组x中n个账户信息,其中,密码用*替代显示 14 15 int main() { 16 Account x[] = {{"A1001", "123456", student}, 17 {"A1002", "123abcdef", student}, 18 {"A1009", "xyz12121", student}, 19 {"X1009", "9213071x", admin}, 20 {"C11553", "129dfg32k", teacher}, 21 {"X3005", "921kfmg917", student}}; 22 int n; 23 n = sizeof(x)/sizeof(Account); 24 output(x, n); 25 26 return 0; 27 } 28 29 30 void output(Account x[], int n) { 31 int i,j; 32 int len = strlen(x[i].password); 33 for( i = 0; i < n; i++){ 34 printf("%-10s", x[i].username); 35 for( j = 0; j < len; j++){ 36 putchar('*'); 37 38 } 39 printf(" "); // 分隔符 40 // 输出账户类型(根据枚举值转换为字符串) 41 switch(x[i].type){ 42 case admin: printf("%-15s", "admin"); break; 43 case student: printf("%-15s", "student"); break; 44 case teacher: printf("%-15s", "teacher"); break; 45 } 46 printf("\n"); 47 } 48 }

任务七
1 #include <stdio.h> 2 #include <string.h> 3 4 typedef struct { 5 char name[20]; // 姓名 6 char phone[12]; // 手机号 7 int vip; // 是否为紧急联系人,是取1;否则取0 8 } Contact; 9 10 // 函数声明 11 void set_vip_contact(Contact x[], int n, char name[]); 12 void output(Contact x[], int n); 13 void display(Contact x[], int n); 14 15 #define N 10 16 17 int main() { 18 Contact list[N] = { 19 {"刘一", "15510846604", 0}, 20 {"陈二", "18038747351", 0}, 21 {"张三", "18853253914", 0}, 22 {"李四", "13230584477", 0}, 23 {"王五", "15547571923", 0}, 24 {"赵六", "18856659351", 0}, 25 {"周七", "17705843215", 0}, 26 {"孙八", "15552933732", 0}, 27 {"吴九", "18077702405", 0}, 28 {"郑十", "18820725036", 0} 29 }; 30 int vip_cnt, i; 31 char name[20]; 32 33 printf("显示原始通讯录信息: \n"); 34 output(list, N); 35 36 printf("\n输入要设置的紧急联系人个数: "); 37 scanf("%d", &vip_cnt); 38 printf("输入%d个紧急联系人姓名:\n", vip_cnt); 39 for(i = 0; i < vip_cnt; ++i) { 40 scanf("%s", name); 41 set_vip_contact(list, N, name); 42 } 43 44 printf("\n显示通讯录列表:(按姓名字典序升序排列,紧急联系人最先显示)\n"); 45 display(list, N); 46 47 return 0; 48 } 49 50 // 设置紧急联系人:将联系人数组x中,姓名与name相同的联系人的vip设为1 51 void set_vip_contact(Contact x[], int n, char name[]) { 52 int i; 53 for ( i = 0; i < n; i++) { 54 if (strcmp(x[i].name, name) == 0) { 55 x[i].vip = 1; 56 } 57 } 58 } 59 60 // 显示联系人信息,排序规则: 61 // 1. 紧急联系人(vip=1)排在非紧急联系人(vip=0)前面 62 // 2. 相同vip时按姓名字典序升序排列 63 void display(Contact x[], int n) { 64 // 选择排序 65 int i,j; 66 for ( i = 0; i < n - 1; i++) { 67 int best = i; // 记录当前最优元素下标 68 for ( j = i + 1; j < n; j++) { 69 // 比较规则:优先比vip,vip相同时比姓名 70 if (x[j].vip > x[best].vip) { 71 best = j; 72 } else if (x[j].vip == x[best].vip && strcmp(x[j].name, x[best].name) < 0) { 73 best = j; 74 } 75 } 76 if (best != i) { 77 Contact temp = x[i]; 78 x[i] = x[best]; 79 x[best] = temp; 80 } 81 } 82 // 调用已有的输出函数 83 output(x, n); 84 } 85 86 // 已有的输出函数(按原始顺序输出,紧急联系人后标记*) 87 void output(Contact x[], int n) { 88 int i; 89 for(i = 0; i < n; ++i) { 90 printf("%-10s%-15s", x[i].name, x[i].phone); 91 if(x[i].vip) 92 printf("%5s", "*"); 93 printf("\n"); 94 } 95 }

浙公网安备 33010602011771号