实验6

实验任务4

源代码

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

运行结果截图

 

image

 

实验任务5

源代码

 

 1 #include <stdio.h>
 2 
 3 typedef struct {
 4     int year;
 5     int month;
 6     int day;
 7 } Date;
 8 
 9 void input(Date *pd);              
10 int day_of_year(Date d);            
11 int compare_dates(Date d1, Date d2);
12 
13 void test1() {
14     Date d;
15     int i;
16     printf("输入日期:(以形如2025-12-19这样的形式输入)\n");
17     for(i = 0; i < 3; ++i) {
18         input(&d);
19         printf("%d-%02d-%02d是这一年中第%d天\n\n", d.year, d.month, d.day, day_of_year(d));
20     }
21 }
22 
23 void test2() {
24     Date Alice_birth, Bob_birth;
25     int i;
26     int ans;
27     printf("输入Alice和Bob出生日期:(以形如2025-12-19这样的形式输入)\n");
28     for(i = 0; i < 3; ++i) {
29         input(&Alice_birth);
30         input(&Bob_birth);
31         ans = compare_dates(Alice_birth, Bob_birth);
32         if(ans == 0)
33             printf("Alice和Bob一样大\n\n");
34         else if(ans == -1)
35             printf("Alice比Bob小\n\n");
36         else
37             printf("Alice比Bob大\n\n");
38     }
39 }
40 
41 void input(Date *pd) {
42     scanf("%d-%d-%d", &pd->year, &pd->month, &pd->day);
43 }
44 
45 int day_of_year(Date d) {
46     int days_of_month[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
47     if ((d.year % 4 == 0 && d.year % 100 != 0) || (d.year % 400 == 0)) {
48         days_of_month[2] = 29;
49     }
50     int total = 0;
51     for (int i = 1; i < d.month; i++) {
52         total += days_of_month[i];
53     }
54     total += d.day;
55     return total;
56 }
57 
58 int compare_dates(Date d1, Date d2) {
59     if (d1.year != d2.year) {
60         return d1.year < d2.year ? -1 : 1;
61     }
62     if (d1.month != d2.month) {
63         return d1.month < d2.month ? -1 : 1;
64     }
65     if (d1.day != d2.day) {
66         return d1.day < d2.day ? -1 : 1;
67     }
68     return 0;
69 }
70 
71 int main() {
72     printf("测试1: 输入日期,打印输出这是一年中第多少天\n");
73     test1();
74     printf("\n测试2: 两个人年龄大小关系\n");
75     test2();
76     return 0;
77 }

 

运行结果截图

 

image

 

实验任务6

源代码

 

 1 #include <stdio.h>
 2 #include <string.h>
 3 
 4 enum Role {admin, student, teacher};
 5 typedef struct {
 6     char username[20];  
 7     char password[20];  
 8     enum Role type;     
 9 } Account;
10 
11 void output(Account x[], int n); 
12 
13 int main() {
14     Account x[] = {{"A1001", "123456", student},
15                     {"A1002", "123abcdef", student},
16                     {"A1009", "xyz12121", student},
17                     {"x1009", "9213071x", admin},
18                     {"c11553", "129dfg32k", teacher},
19                     {"x3005", "921kfmg917", student}};
20     int n;
21     n = sizeof(x)/sizeof(Account);
22     output(x, n);
23     return 0;
24 }
25 
26 void output(Account x[], int n) {
27     char *role_names[] = {"admin", "student", "teacher"};
28     
29     for (int i = 0; i < n; i++) {
30         printf("%-10s", x[i].username);
31         
32         int pwd_len = strlen(x[i].password);
33         for (int j = 0; j < pwd_len; j++) {
34             putchar('*');
35         }
36         printf("%*s%s\n", 16 - pwd_len, "", role_names[x[i].type]);
37     }
38 }

 

运行结果截图

 

image

 

实验任务7

源代码

 

 1 #include <stdio.h>
 2 #include <string.h>
 3 
 4 typedef struct {
 5     char name[20];     
 6     char phone[12];    
 7     int vip;           
 8 } Contact;
 9 
10 void set_vip_contact(Contact x[], int n, char name[]);  
11 void output(Contact x[], int n);   
12 void display(Contact x[], int n);  
13 
14 #define N 10
15 int main() {
16     Contact list[N] = {{"刘一", "15510846604", 0},
17                         {"陈二", "18038747351", 0},
18                         {"张三", "18853253914", 0},
19                         {"李四", "13230584477", 0},
20                         {"王五", "15547571923", 0},
21                         {"赵六", "18856659351", 0},
22                         {"周六", "17705843215", 0},
23                         {"孙八", "15552933732", 0},
24                         {"吴九", "18077702405", 0},
25                         {"郑十", "18820725036", 0}};
26     int vip_cnt, i;
27     char name[20];
28     printf("显示原始通讯录信息: \n");
29     output(list, N);
30     printf("\n输入要设置的紧急联系人个数: ");
31     scanf("%d", &vip_cnt);
32     printf("输入%d个紧急联系人姓名:\n", vip_cnt);
33     for(i = 0; i < vip_cnt; ++i) {
34         scanf("%s", name);
35         set_vip_contact(list, N, name);
36     }
37     printf("\n显示通讯录列表:(按姓名字典序排列,紧急联系人最先显示)\n");
38     display(list, N);
39     return 0;
40 }
41 
42 void set_vip_contact(Contact x[], int n, char name[]) {
43     for (int i = 0; i < n; i++) {
44         if (strcmp(x[i].name, name) == 0) {
45             x[i].vip = 1;
46             return;
47         }
48     }
49 }
50 
51 void output(Contact x[], int n) {
52     int i;
53     for(i = 0; i < n; i++) {
54         printf("%-10s%-15s", x[i].name, x[i].phone);
55         if(x[i].vip)
56             printf("%5s", "*");
57         printf("\n");
58     }
59 }
60 
61 void swap(Contact *a, Contact *b) {
62     Contact temp = *a;
63     *a = *b;
64     *b = temp;
65 }
66 
67 void display(Contact x[], int n) {
68     for (int i = 0; i < n - 1; i++) {
69         for (int j = 0; j < n - 1 - i; j++) {
70             if (x[j].vip < x[j+1].vip) {
71                 swap(&x[j], &x[j+1]);
72             }
73         }
74     }
75     int vip_end = 0;
76     while (vip_end < n && x[vip_end].vip == 1) {
77         vip_end++;
78     }
79     for (int i = 0; i < vip_end - 1; i++) {
80         for (int j = 0; j < vip_end - 1 - i; j++) {
81             if (strcmp(x[j].name, x[j+1].name) > 0) {
82                 swap(&x[j], &x[j+1]);
83             }
84         }
85     }
86     for (int i = vip_end; i < n - 1; i++) {
87         for (int j = vip_end; j < n - 1 - (i - vip_end); j++) {
88             if (strcmp(x[j].name, x[j+1].name) > 0) {
89                 swap(&x[j], &x[j+1]);
90             }
91         }
92     }
93     output(x, n);
94 }

 

运行结果截图

 

image

posted @ 2026-06-14 21:51  X++++++++++++  阅读(2)  评论(0)    收藏  举报