实验6

任务四

源代码

 1 #include <stdio.h>
 2 #define N 10
 3 #include <stdlib.h>
 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 
32     printf("\n图书销售总额: %.2f\n", sales_amount(x, N));
33     system("pause");
34     return 0;
35 }
36 void output(Book x[],int n){
37     int i=0;
38     printf("%-18s %-25s %-15s %-6s %s\n","ISBN号","书号","作者","售价","销售册数");
39     for(i;i<n;i++){
40         printf("%-18s %-25s %-15s %-6.1f %d\n",x[i].isbn,x[i].name,x[i].author,x[i].sales_price,x[i].sales_count);}
41 }
42 void sort(Book x[],int n){
43     int i,j;
44     Book temp;
45     for(i=0;i<n-1;i++){
46         for(j=0;j<n-1-i;j++){
47             if(x[j].sales_count<x[j+1].sales_count){
48                 temp=x[j];
49                 x[j]=x[j+1];
50                 x[j+1]=temp;
51             }
52         }
53     }
54 }
55 double sales_amount(Book x[],int n){
56     double total=0.0;
57     int i=0;
58     for(i;i<n;i++){
59         total+=x[i].sales_price*x[i].sales_count;
60     }
61     return total;
62 }

结果

image

 任务五

源代码

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

结果

image

 任务六

源代码

 1 #include <stdio.h>
 2 #include <string.h>
 3 #include <stdlib.h>
 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);  
14 
15 int main() {
16     Account x[] = {
17         {"A1001", "123456", student},
18         {"A1002", "123abcdef", student},
19         {"A1009", "xyz12121", student},
20         {"X1009", "9213071x", admin},
21         {"C11553", "129dfg32k", teacher},
22         {"X3005", "921kfmg917", student}
23     };
24 
25     int n;
26     n = sizeof(x) / sizeof(Account);
27     output(x, n);
28     system("pause");
29     return 0;
30 }
31 
32 
33 void output(Account x[], int n) {
34     int i,j;
35     for ( i = 0; i < n; i++) {
36         int pwd_len = strlen(x[i].password);
37         printf("%-10s ", x[i].username);
38 
39        
40         
41         for ( j = 0; j < pwd_len; j++) {
42             printf("*");
43         }
44         
45         printf("%*s", 12 - pwd_len, "");
46 
47        
48         switch (x[i].type) {
49             case admin:
50                 printf("admin\n");
51                 break;
52             case student:
53                 printf("student\n");
54                 break;
55             case teacher:
56                 printf("teacher\n");
57                 break;
58             default:
59                 printf("unknown\n");
60         }
61     }
62 }

结果

屏幕截图 2026-06-10 125810

 

任务七

源代码

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

 

结果

屏幕截图 2026-06-10 130605

 

posted @ 2026-06-10 13:06  kasdda  阅读(9)  评论(0)    收藏  举报