快捷導(dǎo)航

C語言實現(xiàn)學(xué)生成績管理系統(tǒng)

更新時間：2018年01月13日 13:51:47 作者：Lu_1u

這篇文章主要為大家詳細介紹了C語言實現(xiàn)學(xué)生成績管理系統(tǒng)，具有一定的參考價值，感興趣的小伙伴們可以參考一下

設(shè)計一個學(xué)生成績管理系統(tǒng)，實現(xiàn)對學(xué)生成績的動態(tài)管理，實現(xiàn)對學(xué)生成績的輸入，顯示，刪除，查找，插入，最佳，保存，計算，排序等主要功能。

功能要求

1、每一條記錄包括一個學(xué)生的學(xué)號、姓名、3門課成績、平均成績。
2、輸入功能：可以一次完成若干條記錄的輸入。
3、顯示功能：完成全部學(xué)生記錄的顯示。
4、查找功能：完成按姓名查找學(xué)生記錄，并顯示。
5、排序功能：按學(xué)生平均成績進行排序。
6、插入功能：按平均成績高低插入一條學(xué)生記錄
7、刪除功能：如果輸入錯誤，可以刪除學(xué)生記錄；
8、退出。

代碼：

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define SIZE_NAME 10
#define SIZE_ID 20

int Record = 0;

typedef struct {
 char name[SIZE_NAME];
 char id[SIZE_ID];
 int a, b, c;
 int ava;
}pInfo;

typedef struct node {
 pInfo people;
 struct node *next;
}linkList;

int menu();
int create(linkList *head);
int display(linkList *head);
int search(linkList *head, char *info);
int modify(linkList *head, char *pid);
int add2(linkList *head, char *pid);
int delt(linkList *head, char *info);
int compare(int ava1, int ava2);
int sort(linkList *head, int boolean);//1升序 0降序 


int main()
{
 linkList head, *p;
 char info[SIZE_ID];
 int temp, chus, i;
 head.next = NULL;

 while (1) {
 switch (menu()) {
 case 1:
  create(&head);
  break;
 case 2:
  display(&head);
  break;
 case 3:
  printf("請輸入需要查詢的學(xué)號或姓名: ");
  scanf("%s", info);
  p = &head;
  p = p->next;
  for (i = 0; i < search(&head, info); i++) {
  p = p->next;
  }
  printf("搜索到:\n");
  printf("\t\t\t\t學(xué)生信息\n");
  printf("--------------------------------------------------------------------------------\n");
  printf("\t\t學(xué)號\t\t姓名\t\t\t平均成績\n");
  printf("--------------------------------------------------------------------------------\n");
  printf("%20s\t", p->people.id);
  printf("%10s\t", p->people.name);
  printf("%20d\n", p->people.ava);
  break;
 case 4:
  printf("請輸入需要修改的學(xué)號: ");
  scanf("%s", info);
  modify(&head, info);
  break;
 case 5:
  printf("請輸入需要添加的學(xué)號: ");
  scanf("%s", info);
  add2(&head, info);
  break;
 case 6:
  printf("請輸入需要刪除的學(xué)號或姓名: ");
  scanf("%s", info);
  delt(&head, info);
  break;
 case 7:
  printf("請輸入1或0:\n\t1:升序\n\t0:降序\n");
  scanf("%d", &temp);
  sort(&head, temp);
  break;
 case 8:
  exit(0);
  break;
 default:
  printf("輸錯了，再來一次\n");
 }
 system("pause");
 system("cls");
 }
 system("pause");
 return 0;
}

int menu()
{
 int chus;
 printf("\t學(xué)生信息\n\n");
 printf("請輸入(1 -- 8):\n");
 printf("\t1.創(chuàng)建學(xué)生信息\n");
 printf("\t2.顯示學(xué)生信息\n");
 printf("\t3.查詢學(xué)生信息\n");
 printf("\t4.修改學(xué)生信息\n");
 printf("\t5.添加學(xué)生信息\n");
 printf("\t6.刪除學(xué)生信息\n");
 printf("\t7.排序?qū)W生成績\n");
 printf("\t8.退出\n");
 scanf("%d", &chus);
 return chus;
}

int create(linkList *head)
{
 linkList *s, *p;
 p = head;
 printf("請輸入學(xué)號 姓名 三科成績,輸入end結(jié)束\n");
 while (1) {
 s = (linkList*)malloc(sizeof(linkList));
 scanf("%s", s->people.id);
 if (!strcmp(s->people.id, "end")) {
  return 0;
 }
 scanf("%s", s->people.name);
 scanf("%d", &s->people.a);
 scanf("%d", &s->people.b);
 scanf("%d", &s->people.c);
 s->people.ava = (s->people.a + s->people.b + s->people.c) / 3;

 s->next = p->next;
 p->next = s;
 p = s;
 Record++;
 }
 return 0;
}

int display(linkList *head)
{
 int i;
 linkList *p;
 p = head;
 p = p->next;
 printf("\t\t\t\t學(xué)生信息\n");
 printf("--------------------------------------------------------------------------------\n");
 printf("\t\t學(xué)號\t\t姓名\t\t\t平均成績\n");
 printf("--------------------------------------------------------------------------------\n");
 for (i = 0; i < Record; i++, p = p->next) {
 printf("%20s\t", p->people.id);
 printf("%10s\t", p->people.name);
 printf("%20d\n", p->people.ava);
 }

 return 0;
}

int search(linkList *head, char *info)
{
 int i;
 linkList *p;
 p = head;
 p = p->next;
 for (i = 0; i < Record; i++, p = p->next) {
 if ((!strcmp(p->people.id, info)) || (!strcmp(info, p->people.name))) {
  return i;
 }
 }
 return -1;
}

int modify(linkList *head, char *pid)
{
 int i;
 linkList *p;
 p = head;
 p = p->next;
 for (i = 0; i < search(head, pid); i++) {
 p = p->next;
 }
 printf("請輸入新信息:\n");
 scanf("%s", p->people.id);
 scanf("%s", p->people.name);
 scanf("%d", &p->people.a);
 scanf("%d", &p->people.b);
 scanf("%d", &p->people.c);
 p->people.ava = (p->people.a + p->people.b + p->people.c) / 3;
 return 0;
}

int add2(linkList *head, char *pid)
{
 int i;
 linkList *p, *s;
 p = head;
 p = p->next;
 s = (linkList*)malloc(sizeof(linkList));
 while (p->next != NULL) {
 p = p->next;
 }
 printf("請輸入需要添加的姓名和成績:\n");
 strcpy(s->people.id, pid);
 scanf("%s", s->people.name);
 scanf("%d", &s->people.a);
 scanf("%d", &s->people.b);
 scanf("%d", &s->people.c);
 s->people.ava = (s->people.a + s->people.b + s->people.c) / 3;
 if (search(head, s->people.id) == -1) {
 s->next = p->next;
 p->next = s;
 Record++;
 }
 else {
 printf("學(xué)號重復(fù)了\n");
 }
 sort(head, 0);
 return 0;
}

int delt(linkList *head, char *info)
{
 int i, n;
 linkList *p, *s;
 p = head;
 n = search(head, info);
 if (-1 == n) {
 printf("沒有找到\n");
 return 0;
 }
 for (i = 0; i < n; i++) {
 p = p->next;
 }
 p->next = p->next->next;
 Record--;
 return 0;
}
int compare(int ava1, int ava2)
{
 if (ava1 < ava2) {
 return 1;
 }
 return 0;
}

int sort(linkList *head, int boolean)
{
 linkList *p, *pre;
 pInfo temp;
 if (boolean) {
 for (p = head->next; p != NULL; p = p->next) {
  for (pre = p->next; pre != NULL; pre = pre->next) {
  if (0 == compare(p->people.ava, pre->people.ava)) {
   temp = p->people;
   p->people = pre->people;
   pre->people = temp;
  }
  }
 }
 }
 else {
 for (p = head->next; p != NULL; p = p->next) {
  for (pre = p->next; pre != NULL; pre = pre->next) {
  if (1 == compare(p->people.ava, pre->people.ava)) {
   temp = p->people;
   p->people = pre->people;
   pre->people = temp;
  }
  }
 }
 }
 return 0;
}

更多學(xué)習(xí)資料請關(guān)注專題《管理系統(tǒng)開發(fā)》。

以上就是本文的全部內(nèi)容，希望對大家的學(xué)習(xí)有所幫助，也希望大家多多支持腳本之家。

您可能感興趣的文章: