实验 6 C 语言结构体和枚举应用编程
task1.c
源代码：
1 #define _CRT_SECURE_NO_WARNINGS 2 #include <stdio.h> 3 #include <string.h> 4 #include <stdlib.h> 5 #define N 3 6 7 typedef struct student { 8 int id; 9 char name[20]; 10 char subject[20]; 11 double perf; 12 double mid; 13 double final; 14 double total; 15 char level[10]; 16 } STU; 17 18 void input(STU s[], int n); 19 void output(STU s[], int n); 20 void calc(STU s[], int n); 21 int fail(STU s[], STU t[], int n); 22 void sort(STU s[], int n); 23 24 int main() { 25 STU st[N], fst[N]; 26 int k; 27 28 printf("录入学生成绩信息:\n"); 29 input(st, N); 30 31 printf("\n成绩处理...\n"); 32 calc(st, N); 33 34 k = fail(st, fst, N); 35 sort(st, N); 36 37 printf("\n学生成绩排名情况:\n"); 38 output(st, N); 39 40 printf("\n不及格学生信息:\n"); 41 output(fst, k); 42 43 system("pause"); 44 return 0; 45 } 46 47 void input(STU s[], int n) { 48 int i; 49 for (i = 0; i < n; i++) { 50 scanf("%d %s %s %lf %lf %lf", &s[i].id, s[i].name, s[i].subject, 51 &s[i].perf, &s[i].mid, &s[i].final); 52 } 53 } 54 55 void output(STU s[], int n) { 56 int i; 57 printf("学号\t姓名\t科目\t平时\t期中\t期末\t总评\t等级\n"); 58 for (i = 0; i < n; i++) { 59 printf("%d\t%s\t%s\t%.0f\t%.0f\t%.0f\t%.1f\t%s\n", 60 s[i].id, s[i].name, s[i].subject, 61 s[i].perf, s[i].mid, s[i].final, 62 s[i].total, s[i].level); 63 } 64 } 65 66 void calc(STU s[], int n) { 67 int i; 68 for (i = 0; i < n; i++) { 69 s[i].total = s[i].perf * 0.2 + s[i].mid * 0.2 + s[i].final * 0.6; 70 if (s[i].total >= 90) 71 strcpy(s[i].level, "优"); 72 else if (s[i].total >= 80) 73 strcpy(s[i].level, "良"); 74 else if (s[i].total >= 70) 75 strcpy(s[i].level, "中"); 76 else if (s[i].total >= 60) 77 strcpy(s[i].level, "及格"); 78 else 79 strcpy(s[i].level, "不及格"); 80 } 81 } 82 83 int fail(STU s[], STU t[], int n) { 84 int i, cnt = 0; 85 for (i = 0; i < n; i++) { 86 if (s[i].total < 60) { 87 t[cnt++] = s[i]; 88 } 89 } 90 return cnt; 91 } 92 void sort(STU s[], int n) { 93 int i, j; 94 STU t; 95 for (i = 0; i < n - 1; i++) { 96 for (j = 0; j < n - 1 - i; j++) { 97 if (s[j].total < s[j + 1].total) { 98 t = s[j]; 99 s[j] = s[j + 1]; 100 s[j + 1] = t; 101 } 102 } 103 } 104 }
运行结果截图：
task2.c
源代码：
1 #define _CRT_SECURE_NO_WARNINGS 2 #include <stdio.h> 3 #include <string.h> 4 #include <stdlib.h> 5 #define N 10 6 #define M 80 7 8 typedef struct { 9 char name[M]; 10 char author[M]; 11 } Book; 12 13 int main() { 14 Book x[N] = { 15 {"《一九八四》", "乔治.奥威尔"}, 16 {"《美丽新世界》", "赫胥黎"}, 17 {"《昨日的世界》", "斯蒂芬.茨威格"}, 18 {"《万历十五年》", "黄仁宇"}, 19 {"《一只特立独行的猪》", "王小波"}, 20 {"《百年孤独》", "马尔克斯"}, 21 {"《查令十字街84号》", "海莲.汉芙"}, 22 {"《只是孩子》", "帕蒂.史密斯"}, 23 {"《刀锋》", "毛姆"}, 24 {"《沉默的大多数》", "王小波"} 25 }; 26 Book* ptr; 27 char author[M]; 28 int found = 0; 29 30 printf("------------------- 所有图书信息-------------------\n"); 31 for (ptr = x; ptr < x + N; ++ptr) { 32 printf("%-30s %-30s\n", ptr->name, ptr->author); 33 } 34 printf("\n-------------------按作者查询图书-------------------\n"); 35 printf("输入作者名: "); 36 gets(author); 37 for (ptr = x; ptr < x + N; ++ptr) { 38 if (strcmp(ptr->author, author) == 0) { 39 found = 1; 40 printf("%-30s %-30s\n", ptr->name, ptr->author); 41 } 42 } 43 if (!found) { 44 printf("暂未收录该作者书籍!\n"); 45 } 46 47 system("pause"); 48 return 0; 49 }
运行结果截图：
task3-1.c
源代码：
1 #define _CRT_SECURE_NO_WARNINGS 2 #include <stdio.h> 3 #include <stdlib.h> 4 #define N 80 5 6 typedef struct FilmInfo { 7 char name[N]; 8 char director[N]; 9 char region[N]; 10 int year; 11 struct FilmInfo* next; 12 } Film; 13 14 void output(Film* head); 15 Film* insert(Film* head, int n); 16 17 int main() { 18 int n; 19 Film* head; 20 head = NULL; 21 22 printf("输入影片数目: "); 23 scanf("%d", &n); 24 head = insert(head, n); 25 26 printf("\n所有影片信息如下: \n"); 27 output(head); 28 29 system("pause"); 30 return 0; 31 } 32 33 Film* insert(Film* head, int n) { 34 int i; 35 Film* p; 36 for (i = 1; i <= n; ++i) { 37 p = (Film*)malloc(sizeof(Film)); 38 printf("请输入第%d部影片信息(名称 导演 地区 年份): ", i); 39 scanf("%s %s %s %d", p->name, p->director, p->region, &p->year); 40 p->next = head; 41 head = p; 42 } 43 return head; 44 } 45 46 void output(Film* head) { 47 Film* p = head; 48 while (p != NULL) { 49 printf("%-20s %-20s %-20s %d\n", p->name, p->director, p->region, p->year); 50 p = p->next; 51 } 52 }
运行结果截图：
task3-2.c
源代码：
1 #define _CRT_SECURE_NO_WARNINGS 2 #include <stdio.h> 3 #include <stdlib.h> 4 #define N 80 5 6 typedef struct FilmInfo { 7 char name[N]; 8 char director[N]; 9 char region[N]; 10 int year; 11 struct FilmInfo* next; 12 } Film; 13 14 void output(Film* head); 15 Film* insert(Film* head, int n); 16 17 int main() { 18 int n; 19 Film* head, * p; 20 p = (Film*)malloc(sizeof(Film)); 21 p->next = NULL; 22 head = p; 23 24 printf("输入影片数目: "); 25 scanf("%d", &n); 26 head = insert(head, n); 27 28 printf("\n所有影片信息如下: \n"); 29 output(head); 30 31 system("pause"); 32 return 0; 33 } 34 35 Film* insert(Film* head, int n) { 36 int i; 37 Film* p; 38 for (i = 1; i <= n; ++i) { 39 p = (Film*)malloc(sizeof(Film)); 40 printf("请输入第%d部影片信息(名称 导演 地区 年份): ", i); 41 scanf("%s %s %s %d", p->name, p->director, p->region, &p->year); 42 p->next = head->next; 43 head->next = p; 44 } 45 return head; 46 } 47 48 void output(Film* head) { 49 Film* p = head->next; 50 while (p != NULL) { 51 printf("%-20s %-20s %-20s %d\n", p->name, p->director, p->region, p->year); 52 p = p->next; 53 } 54 }
运行结果截图：
task4.c
源代码：
1 #define _CRT_SECURE_NO_WARNINGS 2 #include <stdio.h> 3 #define N 10 4 #include<stdlib.h> 5 typedef struct { 6 char isbn[20]; 7 char name[80]; 8 char author[80]; 9 double sales_price; 10 int sales_count; 11 } Book; 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] = { 19 {"978-7-5327-6082-4", "门将之死", "罗纳德.伦", 42, 51}, 20 {"978-7-308-17047-5", "自由与爱之地:入以色列记", "云也退", 49 , 30}, 21 {"978-7-5404-9344-8", "伦敦人", "克莱格泰勒", 68, 27}, 22 {"978-7-5447-5246-6", "软件体的生命周期", "特德姜", 35, 90}, 23 {"978-7-5722-5475-8", "芯片简史", "汪波", 74.9, 49}, 24 {"978-7-5133-5750-0", "主机战争", "布莱克.J.哈里斯", 128, 42}, 25 {"978-7-2011-4617-1", "世界尽头的咖啡馆", "约翰·史崔勒基", 22.5, 44}, 26 {"978-7-5133-5109-6", "你好外星人", "英国未来出版集团", 118, 42}, 27 {"978-7-1155-0509-5", "无穷的开始:世界进步的本源", "戴维·多伊奇", 37.5, 55}, 28 {"978-7-229-14156-1", "源泉", "安.兰德", 84, 59} 29 }; 30 31 printf("图书销量排名(按销售册数): \n"); 32 sort(x, N); 33 output(x, N); 34 printf("\n图书销售总额: %.2f\n", sales_amount(x, N)); 35 36 system("pause"); 37 return 0; 38 } 39 40 void output(Book x[], int n) { 41 int i; 42 printf("%-20s %-30s %-20s %-8s %-8s\n", "ISBN号", "书名", "作者", "售价", "销售册数"); 43 for (i = 0; i < n; i++) { 44 printf("%-20s %-30s %-20s %-8.2f %-8d\n", 45 x[i].isbn, x[i].name, x[i].author, x[i].sales_price, x[i].sales_count); 46 } 47 } 48 49 void sort(Book x[], int n) { 50 int i, j; 51 Book temp; 52 for (i = 0; i < n - 1; i++) { 53 for (j = 0; j < n - 1 - i; j++) { 54 if (x[j].sales_count < x[j + 1].sales_count) { 55 temp = x[j]; 56 x[j] = x[j + 1]; 57 x[j + 1] = temp; 58 } 59 } 60 } 61 } 62 63 double sales_amount(Book x[], int n) { 64 double sum = 0; 65 int i; 66 for (i = 0; i < n; i++) { 67 sum += x[i].sales_price * x[i].sales_count; 68 } 69 return sum; 70 }
运行结果截图：
task5.c
源代码：
1 #define _CRT_SECURE_NO_WARNINGS 2 #include <stdio.h> 3 #include <stdlib.h> 4 5 typedef struct { 6 int year; 7 int month; 8 int day; 9 } Date; 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 printf("输入日期:(以形如2025-12-19这样的形式输入)\n"); 18 for (i = 0; i < 3; ++i) { 19 input(&d); 20 printf("%d-%02d-%02d是这一年中第%d天\n\n", 21 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, ans; 28 printf("输入Alice和Bob出生日期:(以形如2025-12-19这样的形式输入)\n"); 29 for (i = 0; i < 3; ++i) { 30 input(&Alice_birth); 31 input(&Bob_birth); 32 ans = compare_dates(Alice_birth, Bob_birth); 33 if (ans == 0) 34 printf("Alice和Bob一样大\n\n"); 35 else if (ans == -1) 36 printf("Alice比Bob大\n\n"); 37 else 38 printf("Alice比Bob小\n\n"); 39 } 40 } 41 42 int main() { 43 printf("测试1: 输入日期, 打印输出这是一年中第多少天\n"); 44 test1(); 45 46 printf("\n测试2: 两个人年龄大小关系\n"); 47 test2(); 48 49 system("pause"); 50 return 0; 51 } 52 53 void input(Date* pd) { 54 scanf("%d-%d-%d", &pd->year, &pd->month, &pd->day); 55 } 56 57 int isLeap(int y) { 58 if ((y % 4 == 0 && y % 100 != 0) || (y % 400 == 0)) 59 return 1; 60 return 0; 61 } 62 63 int day_of_year(Date d) { 64 int days[13] = { 0,31,28,31,30,31,30,31,31,30,31,30,31 }; 65 int sum = 0, i; 66 if (isLeap(d.year)) 67 days[2] = 29; 68 69 for (i = 1; i < d.month; i++) { 70 sum += days[i]; 71 } 72 sum += d.day; 73 return sum; 74 } 75 76 int compare_dates(Date d1, Date d2) { 77 if (d1.year < d2.year) return -1; 78 if (d1.year > d2.year) return 1; 79 80 if (d1.month < d2.month) return -1; 81 if (d1.month > d2.month) return 1; 82 83 if (d1.day < d2.day) return -1; 84 if (d1.day > d2.day) return 1; 85 86 return 0; 87 }
运行结果截图：
task6.c
源代码：
1 #define _CRT_SECURE_NO_WARNINGS 2 #include <stdio.h> 3 #include <string.h> 4 #include <stdlib.h> 5 6 enum Role { admin, student, teacher }; 7 8 typedef struct { 9 char username[20]; 10 char password[20]; 11 enum Role type; 12 } Account; 13 14 void output(Account x[], int n); 15 16 int main() { 17 Account x[] = { 18 {"A1001", "123456", student}, 19 {"A1002", "123abcdef", student}, 20 {"A1009", "xyz12121", student}, 21 {"X1009", "9213071x", admin}, 22 {"C11553", "129dfg32k", teacher}, 23 {"X3005", "921kfmg917", student} 24 }; 25 int n = sizeof(x) / sizeof(Account); 26 output(x, n); 27 28 system("pause"); 29 return 0; 30 } 31 32 void output(Account x[], int n) { 33 int i, j, len; 34 char roleStr[20]; 35 for (i = 0; i < n; i++) { 36 37 printf("%-10s ", x[i].username); 38 len = strlen(x[i].password); 39 for (j = 0; j < len; j++) { 40 printf("*"); 41 } 42 printf("\t"); 43 switch (x[i].type) { 44 case admin: strcpy(roleStr, "admin"); break; 45 case student: strcpy(roleStr, "student"); break; 46 case teacher: strcpy(roleStr, "teacher"); break; 47 } 48 printf("%s\n", roleStr); 49 } 50 }
运行结果截图：
task7.c
源代码：
1 #define _CRT_SECURE_NO_WARNINGS 2 #include <stdio.h> 3 #include <string.h> 4 #include <stdlib.h> 5 6 typedef struct { 7 char name[20]; 8 char phone[12]; 9 int vip; 10 } Contact; 11 12 #define N 10 13 14 void set_vip_contact(Contact x[], int n, char name[]); 15 void output(Contact x[], int n); 16 void display(Contact x[], int n); 17 void sortByName(Contact arr[], int n); 18 19 int main() { 20 Contact list[N] = { 21 {"刘一", "15510846604", 0}, 22 {"陈二", "18038747351", 0}, 23 {"张三", "18853253914", 0}, 24 {"李四", "13230584477", 0}, 25 {"王五", "15547571923", 0}, 26 {"赵六", "18856659351", 0}, 27 {"周七", "17705843215", 0}, 28 {"孙八", "15552933732", 0}, 29 {"吴九", "18077702405", 0}, 30 {"郑十", "18820725036", 0} 31 }; 32 33 int vip_cnt, i; 34 char name[20]; 35 36 printf("显示原始通讯录信息: \n"); 37 output(list, N); 38 39 printf("\n输入要设置的紧急联系人个数: "); 40 scanf("%d", &vip_cnt); 41 printf("输入%d个紧急联系人姓名:\n", vip_cnt); 42 for (i = 0; i < vip_cnt; ++i) { 43 scanf("%s", name); 44 set_vip_contact(list, N, name); 45 } 46 47 printf("\n显示通讯录列表:(按姓名字典序升序排列,紧急联系人最先显示)\n"); 48 display(list, N); 49 50 system("pause"); 51 return 0; 52 } 53 54 void set_vip_contact(Contact x[], int n, char name[]) { 55 int i; 56 for (i = 0; i < n; i++) { 57 if (strcmp(x[i].name, name) == 0) { 58 x[i].vip = 1; 59 break; 60 } 61 } 62 } 63 64 void output(Contact x[], int n) { 65 int i; 66 for (i = 0; i < n; i++) { 67 printf("%-10s %-15s", x[i].name, x[i].phone); 68 if (x[i].vip) 69 printf(" *"); 70 printf("\n"); 71 } 72 } 73 void sortByName(Contact arr[], int n) { 74 int i, j; 75 Contact temp; 76 for (i = 0; i < n - 1; i++) { 77 for (j = 0; j < n - 1 - i; j++) { 78 if (strcmp(arr[j].name, arr[j + 1].name) > 0) { 79 temp = arr[j]; 80 arr[j] = arr[j + 1]; 81 arr[j + 1] = temp; 82 } 83 } 84 } 85 } 86 87 void display(Contact x[], int n) { 88 Contact temp[N]; 89 int p1 = 0, p2 = n - 1; 90 int i; 91 for (i = 0; i < n; i++) { 92 if (x[i].vip == 1) { 93 temp[p1++] = x[i]; 94 } 95 else { 96 temp[p2--] = x[i]; 97 } 98 } 99 sortByName(temp, p1); 100 sortByName(temp + p1, n - p1); 101 102 output(temp, n); 103 }
运行结果截图：
浙公网安备 33010602011771号