大一c语言学生成绩管理系统，大一c语言编程题库100题
大家好，今天来为大家分享大一c语言学生成绩管理系统的一些知识点，和大一c语言编程题库100题的问题解析，大家要是都明白，那么可以忽略，如果不太清楚的话可以看看本篇文章，相信很大概率可以解决您的问题，接下来我们就一起来看看吧！
怎样用c语言编写一个学生成绩管理系统
我大一时写了个，贴上来给你。
/*********************************************************
*创建日期：2011-04-27
*程序名称：链表综合操作（学生成绩管理系统）
*程序作者：木芽锺
*备注信息：
**********************************************************/
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define SN 3//课程门数，可以自定义
typedef struct student
{
char num[10],
name[10];
float score[SN],
sum,
avg;
struct student*next;
}STU;
/**********输入链表单元内容************/
void input(STU*p)
{
int i;
printf("please input number:\n");
scanf("%s",p->num);
printf("please input name:\n");
scanf("%s",p->name);
printf("please input%d scores:\n",SN);
p->sum=0;
for(i=0;i<SN;i++)
{
scanf("%f",&p->score[i]);
p->sum+=p->score[i];
}
p->avg=p->sum/SN;
}
/**********创建一个链表单元**********/
STU*creat_node()
{
STU*p;
p=(STU*)malloc(sizeof(STU));
if(p== NULL)
{ printf("No enough memory!");
exit(0);
}
input(p);
p->next=NULL;
return p;
}
/**********创建一个链表**********/
STU*creat_list()
{
STU*head=NULL,*tail=NULL,*p;
char str[4];
printf("List creating...\n");
do
{
printf("Do you want to continue(yes/no):");
scanf("%s",str);
if(strcmp(str,"yes")==0)
{
p=creat_node();
if(head==NULL){head=tail=p;continue;}
tail->next=p;
tail=p;
}
if(strcmp(str,"yes")!=0&&strcmp(str,"no")!=0)
{
printf("You must input'yes' or'no'.\n");
//getchar();
continue;
}
if(strcmp(str,"no")==0)break;
//getchar();
}while(1);
printf("List create end...\n\n");
return head;
}
/************输出一个链表单元**********/
void print_a_node(STU*fin)
{
int i;
printf("%s;\t%s;\t%0.2f;\t%0.2f\t",fin->num,fin->name,fin->avg,fin->sum);
for(i=0;i<SN;i++)
printf("%0.2f\t",fin->score[i]);
putchar(10);
}
/************输出一个链表头部**********/
void print_a_head()
{
int i;
printf("number\tname\tavg\tsum\t");
for(i=0;i<SN;i++)
printf("score%d\t",i+1);
putchar(10);
}
/************输出操作菜单**********/
void print_menu_list()
{
printf("======the operation menu list======\n");
printf("[0]-->exit\n[1]-->creat a list\n[2]-->print the list\n[3]-->insert a list node\n[4]-->select by number\n[5]-->select by name\n");
printf("[6]-->delete a list node\n[7]-->update a list node\n[8]-->order the list by score\n[9]-->print the operation menu list\n");
printf("======the operation menu list======\n");
putchar(10);
}
/************输出链表**********/
int print_list(STU*stu)
{
STU*p=stu;
if(stu==NULL)
{
printf("no records!!!\n");
return(0);
}
print_a_head();
while(p!=NULL)
{
print_a_node(p);
p=p->next;
}
putchar(10);
return(0);
}
/************插入链表单元************/
void insert(STU*stu)
{
STU*tail=stu,*p;
printf("now insert a list node...\n");
while(tail->next!=NULL)
{
tail=tail->next;
}
p=creat_node();
tail->next=p;
printf("Insert end...\n\n");
}
/**********查找链表num**********/
STU*find_num(STU*stu, char num[])
{
STU*p=stu,*pr=NULL;
while(p!=NULL)
{
if(strcmp(p->num,num)==0){pr=p;break;}
p=p->next;
}
return pr;
}
/**********查找链表name**********/
STU*find_name(STU*stu, char name[])
{
STU*p=stu,*pr=NULL;
while(p!=NULL)
{
if(strcmp(p->name,name)==0){pr=p;break;}
p=p->next;
}
return pr;
}
/************删除链表单元************/
STU* delet(STU*stu, char name[])
{
STU*p=stu,*front=stu;
if((p=find_name(stu,name))!=NULL)
{
printf("the delete record:\n");
print_a_head();
print_a_node(p);
}
else
{
printf("can not find the student!\n");
return stu;
}
p=stu;
while(p!=NULL&&strcmp(p->name,name)!=0)
{
front=p;
p=p->next;
}
if(p==stu&&front==stu)stu=NULL;
else front->next=p->next;
if(p!=NULL)p->next=NULL;
free(p);
printf("delete end...\n\n");
return stu;
}
/**********更新链表单元**********/
void update(STU*stu, char name[])
{
STU*fin;
if((fin=find_name(stu,name))!=NULL)
{
printf("before update:\n");
print_a_head();
print_a_node(fin);
}
else
{
printf("can not find the student!\n");
exit(0);
}
printf("please input the new records now...\n");
input(fin);
printf("update end...\n\n");
}
/**********链表单元排序**********/
void order(STU*stu)
{
STU*pi,*pj,*max,temp;
int i;
if(stu!=NULL&&stu->next!=NULL)
{
for(pi=stu;pi!=NULL;pi=pi->next)
{
max=pi;
for(pj=pi->next;pj!=NULL;pj=pj->next)
{
if(max->sum<pj->sum)
max=pj;
}
if(max!=pi)
{
strcpy(temp.num,max->num);
strcpy(max->num,pi->num);
strcpy(pi->num,temp.num);
strcpy(temp.name,max->name);
strcpy(max->name,pi->name);
strcpy(pi->name,temp.name);
temp.sum=pi->sum;
pi->sum=max->sum;
max->sum=temp.sum;
temp.avg=max->avg;
max->avg=pi->avg;
pi->avg=temp.avg;
for(i=0;i<SN;i++)
{
temp.score[i]=max->score[i];
max->score[i]=pi->score[i];
pi->score[i]=temp.score[i];
}
}
}
printf("order end...\n\n");
}
else
printf("do not need to order...\n\n");
}
/************释放链表**********/
void fre(STU*stu)
{
STU*p=stu,*pf;
if(stu==NULL)
{
printf("the list is NULL!\n");
exit(0);
}
while(p!=NULL)
{
pf=p->next;
free(p);
p=pf;
}
if(stu==NULL)
printf("free the list.\n");
}
STU* menu(STU*stu,int cas)
{
STU*fin=NULL;
char a[10];
switch(cas)
{
//创建链表
case 1:
if(stu!=NULL)fre(stu);
stu=creat_list();
break;
//输出链表
case 2:
if(stu==NULL){printf("can not do this operation!\n");putchar(10);break;}
print_list(stu);
break;
//插入链表单元
case 3:
if(stu==NULL){printf("can not do this operation!\n");putchar(10);break;}
insert(stu);
break;
//查找输出number
case 4:
if(stu==NULL){printf("can not do this operation!\n");putchar(10);break;}
printf("please input the'number' you want to find:\n");
scanf("%s",a);
if((fin=find_num(stu,a))!=NULL)
{
print_a_head();
print_a_node(fin);
}
else printf("no found!\n");
break;
//查找输出name
case 5:
if(stu==NULL){printf("can not do this operation!\n");putchar(10);break;}
printf("please input the'name' you want to find:\n");
scanf("%s",a);
if((fin=find_name(stu,a))!=NULL)
{
print_a_head();
print_a_node(fin);
putchar(10);
}
else printf("no found!\n");
break;
//删除链表单元
case 6:
if(stu==NULL){printf("can not do this operation!\n");putchar(10);break;}
printf("please input the'name' you want to delete:\n");
scanf("%s",a);
stu=delet(stu,a);
break;
//更新链表单元
case 7:
if(stu==NULL){printf("can not do this operation!\n");putchar(10);break;}
printf("please input the'name' you want to update:\n");
scanf("%s",a);
update(stu,a);
break;
//链表单元排序
case 8:
if(stu==NULL){printf("can not do this operation!\n");putchar(10);break;}
printf("order by score\n");
order(stu);
break;
//打印链表操作菜单
case 9:
print_menu_list();
break;
default:
printf("can not do this operation!\n");putchar(10);break;
}
return stu;
}
void main()
{
STU*stu=NULL;
int cas;
//打印操作提示
print_menu_list();
//用户操作
do
{
printf("press 0~9 to choose operation!\n");
scanf("%d",&cas);
if(cas<0||cas>9){printf("you must press 0 to 9!\n");continue;}
if(cas!=0)stu=menu(stu,cas);
if(cas==0){printf("operation end!\n\n");fre(stu);}
}while(cas!=0);
//释放链表
fre(stu);
}
用C语言怎么学生成绩管理系统
#include"stdio.h"
#include"stdlib.h"
#include"string.h"
int shoudsave=0;/**/
struct student
{
char num[10];/*学号*/
char name[20];
char sex[4];
int cgrade;
int mgrade;
int egrade;
int totle;
int ave;
char neartime[10];/*最近更新时间*/
};
typedef struct node
{
struct student data;
struct node*next;
}Node,*Link;
void menu()
{
printf("********************************************************************************");
printf("\t1登记学生资料\t\t\t\t\t2删除学生资料\n");
printf("\t3查询学生资料\t\t\t\t\t4修改学生资料\n");
printf("\t5保存学生资料\t\t\t\t\t0退出系统\n");
printf("********************************************************************************\n");
}
void printstart()
{
printf("-----------------------------------------------------------------------\n");
}
void Wrong()
{
printf("\n=====>提示:输入错误!\n");
}
void Nofind()
{
printf("\n=====>提示:没有找到该学生!\n");
}
void printc()/*本函数用于输出中文*/
{
printf("学号\t姓名性别英语成绩数学成绩 C语言成绩总分平均分\n");
}
void printe(Node*p)/*本函数用于输出英文*/
{
printf("%-12s%s\t%s\t%d\t%d\t%d\t%d\t%d\n",p->data.num,p->data.name,p->data.sex,p->data.egrade,p->data.mgrade,p->data.cgrade,p->data.totle,p->data.ave);
}
Node* Locate(Link l,char findmess[],char nameornum[])/*该函数用于定位连表中符合要求的接点，并返回该指针*/
{
Node*r;
if(strcmp(nameornum,"num")==0)/*按学号查询*/
{
r=l->next;
while(r!=NULL)
{
if(strcmp(r->data.num,findmess)==0)
return r;
r=r->next;
}
}
else if(strcmp(nameornum,"name")==0)/*按姓名查询*/
{
r=l->next;
while(r!=NULL)
{
if(strcmp(r->data.name,findmess)==0)
return r;
r=r->next;
}
}
return 0;
}
void Add(Link l)/*增加学生*/
{
Node*p,*r,*s;
char num[10];
r=l;
s=l->next;
while(r->next!=NULL)
r=r->next;/*将指针置于最末尾*/
while(1)
{
printf("请你输入学号(以'0'返回上一级菜单:)");
scanf("%s",num);
if(strcmp(num,"0")==0)
break;
while(s)
{
if(strcmp(s->data.num,num)==0)
{
printf("=====>提示:学号为'%s'的学生已经存在,若要修改请你选择'4修改'!\n",num);
printstart();
printc();
printe(s);
printstart();
printf("\n");
return;
}
s=s->next;
}
p=(Node*)malloc(sizeof(Node));
strcpy(p->data.num,num);
printf("请你输入姓名:");
scanf("%s",p->data.name);
getchar();
printf("请你输入性别:");
scanf("%s",p->data.sex);
getchar();
printf("请你输入c语言成绩:");
scanf("%d",&p->data.cgrade);
getchar();
printf("请你输入数学成绩:");
scanf("%d",&p->data.mgrade);
getchar();
printf("请你输入英语成绩:");
scanf("%d",&p->data.egrade);
getchar();
p->data.totle=p->data.egrade+p->data.cgrade+p->data.mgrade;
p->data.ave=p->data.totle/ 3;
/*信息输入已经完成*/
p->next=NULL;
r->next=p;
r=p;
shoudsave=1;
}
}
void Qur(Link l)/*查询学生*/
{
int sel;
char findmess[20];
Node*p;
if(!l->next)
{
printf("\n=====>提示:没有资料可以查询!\n");
return;
}
printf("\n=====>1按学号查找\n=====>2按姓名查找\n");
scanf("%d",&sel);
if(sel==1)/*学号*/
{
printf("请你输入要查找的学号:");
scanf("%s",findmess);
p=Locate(l,findmess,"num");
if(p)
{
printf("\t\t\t\t查找结果\n");
printstart();
printc();
printe(p);
printstart();
}
else
Nofind();
}
else if(sel==2)/*姓名*/
{
printf("请你输入要查找的姓名:");
scanf("%s",findmess);
p=Locate(l,findmess,"name");
if(p)
{
printf("\t\t\t\t查找结果\n");
printstart();
printc();
printe(p);
printstart();
}
else
Nofind();
}
else
Wrong();
}
void Del(Link l)/*删除*/
{
int sel;
Node*p,*r;
char findmess[20];
if(!l->next)
{
printf("\n=====>提示:没有资料可以删除!\n");
return;
}
printf("\n=====>1按学号删除\n=====>2按姓名删除\n");
scanf("%d",&sel);
if(sel==1)
{
printf("请你输入要删除的学号:");
scanf("%s",findmess);
p=Locate(l,findmess,"num");
if(p)
{
r=l;
while(r->next!=p)
r=r->next;
r->next=p->next;
free(p);
printf("\n=====>提示:该学生已经成功删除!\n");
shoudsave=1;
}
else
Nofind();
}
else if(sel==2)
{
printf("请你输入要删除的姓名:");
scanf("%s",findmess);
p=Locate(l,findmess,"name");
if(p)
{
r=l;
while(r->next!=p)
r=r->next;
r->next=p->next;
free(p);
printf("\n=====>提示:该学生已经成功删除!\n");
shoudsave=1;
}
else
Nofind();
}
else
Wrong();
}
void Modify(Link l)
{
Node*p;
char findmess[20];
if(!l->next)
{
printf("\n=====>提示:没有资料可以修改!\n");
return;
}
printf("请你输入要修改的学生学号:");
scanf("%s",findmess);
p=Locate(l,findmess,"num");
if(p)
{
printf("请你输入新学号(原来是%s):",p->data.num);
scanf("%s",p->data.num);
printf("请你输入新姓名(原来是%s):",p->data.name);
scanf("%s",p->data.name);
getchar();
printf("请你输入新性别(原来是%s):",p->data.sex);
scanf("%s",p->data.sex);
printf("请你输入新的c语言成绩(原来是%d分):",p->data.cgrade);
scanf("%d",&p->data.cgrade);
getchar();
printf("请你输入新的数学成绩(原来是%d分):",p->data.mgrade);
scanf("%d",&p->data.mgrade);
getchar();
printf("请你输入新的英语成绩(原来是%d分):",p->data.egrade);
scanf("%d",&p->data.egrade);
p->data.totle=p->data.egrade+p->data.cgrade+p->data.mgrade;
p->data.ave=p->data.totle/3;
printf("\n=====>提示:资料修改成功!\n");
shoudsave=1;
}
else
Nofind();
}
void Disp(Link l)
{
int count=0;
Node*p;
p=l->next;
if(!p)
{
printf("\n=====>提示:没有资料可以显示!\n");
return;
}
printf("\t\t\t\t显示结果\n");
printstart();
printc();
printf("\n");
while(p)
{
printe(p);
p=p->next;
}
printstart();
printf("\n");
}
void Tongji(Link l)
{
Node*pm,*pe,*pc,*pt,*pa;/*用于指向分数最高的接点*/
Node*r=l->next;
if(!r)
{
printf("\n=====>提示:没有资料可以统计!\n");
return;
}
pm=pe=pc=pt=pa=r;
while(r!=NULL)
{
if(r->data.cgrade>=pc->data.cgrade)
pc=r;
if(r->data.mgrade>=pm->data.mgrade)
pm=r;
if(r->data.egrade>=pe->data.egrade)
pe=r;
if(r->data.totle>=pt->data.totle)
pt=r;
if(r->data.ave>=pa->data.ave)
pa=r;
r=r->next;
}
printf("------------------------------统计结果--------------------------------\n");
printf("总分最高者:\t%s%d分\n",pt->data.name,pt->data.totle);
printf("平均分最高者:\t%s%d分\n",pa->data.name,pa->data.ave);
printf("英语最高者:\t%s%d分\n",pe->data.name,pe->data.egrade);
printf("数学最高者:\t%s%d分\n",pm->data.name,pm->data.mgrade);
printf("c语言最高者:\t%s%d分\n",pc->data.name,pc->data.cgrade);
printstart();
}
void Sort(Link l)
{
Link ll;
Node*p,*rr,*s;
ll=(Link)malloc(sizeof(Node));/*用于做新的连表*/
ll->next=NULL;
if(l->next==NULL)
{
printf("\n=====>提示:没有资料可以排序!\n");
return;
}
p=l->next;
while(p)
{
s=(Node*)malloc(sizeof(Node));/*新建接点用于保存信息*/
s->data=p->data;
s->next=NULL;
rr=ll;
while(rr->next!=NULL&& rr->next->data.totle>=p->data.totle)
rr=rr->next;
if(rr->next==NULL)
rr->next=s;
else
{
s->next=rr->next;
rr->next=s;
}
p=p->next;
}
free(l);
l->next=ll->next;
printf("\n=====>提示:排序已经完成!\n");
}
void Save(Link l)
{
FILE* fp;
Node*p;
int flag=1,count=0;
fp=fopen("c:\\student","wb");
if(fp==NULL)
{
printf("\n=====>提示:重新打开文件时发生错误!\n");
exit(1);
}
p=l->next;
while(p)
{
if(fwrite(p,sizeof(Node),1,fp)==1)
{
p=p->next;
count++;
}
else
{
flag=0;
break;
}
}
if(flag)
{
printf("\n=====>提示:文件保存成功.(有%d条记录已经保存.)\n",count);
shoudsave=0;
}
fclose(fp);
}
void main()
{
Link l;/*连表*/
FILE*fp;/*文件指针*/
int sel;
char ch;
char jian;
int count=0;
Node*p,*r;
printf("\t\t\t\t学生成绩管理系统\n\t\t\t\t-------福建农业职业学院计应0501黄欢(32号)\n");
l=(Node*)malloc(sizeof(Node));
l->next=NULL;
r=l;
fp=fopen("C:\\student","rb");
if(fp==NULL)
{
printf("\n=====>提示:文件还不存在，是否创建？(y/n)\n");
scanf("%c",&jian);
if(jian=='y'||jian=='Y')
fp=fopen("C:\\student","wb");
else
exit(0);
}
printf("\n=====>提示:文件已经打开,正在导入记录......\n");
while(!feof(fp))
{
p=(Node*)malloc(sizeof(Node));
if(fread(p,sizeof(Node),1,fp))/*将文件的内容放入接点中*/
{
p->next=NULL;
r->next=p;
r=p;/*将该接点挂入连中*/
count++;
}
}
fclose(fp);/*关闭文件*/
printf("\n=====>提示:记录导入完毕,共导入%d条记录.\n",count);
while(1)
{
menu();
printf("请你选择操作:");
scanf("%d",&sel);
if(sel==0)
{
if(shoudsave==1)
{ getchar();
printf("\n=====>提示:资料已经改动,是否将改动保存到文件中(y/n)?\n");
scanf("%c",&ch);
if(ch=='y'||ch=='Y')
Save(l);
}
printf("\n=====>提示:你已经退出系统,再见!\n");
break;
}
switch(sel)
{
case 1:Add(l);break;/*增加学生*/
case 2:Del(l);break;/*删除学生*/
case 3:Qur(l);break;/*查询学生*/
case 4:Modify(l);break;/*修改学生*/
case 5:Save(l);break;/*保存学生*/
case 9:printf("\t\t\t==========帮助信息==========\n");break;
default: Wrong();getchar();break;
}
}
}
/**/
/*
学生成绩管理程序
编制一个统计学生考试分数的管理程序。
设学生成绩已以一个学生一个记录的形式存储在文件中，
每位学生记录包含的信息有：姓名，学号和各门功课的成绩。
程序具有以下几项功能：求出各门课程的总分，平均分，按姓名，
按学号寻找其记录并显示，浏览全部学生成绩和按总分由高到低显示学生信息等。
*/
#include<stdio.h>
#define SWN 3/*课程数*/
#define NAMELEN 20/*姓名最大字符数*/
#define CODELEN 10/*学号最大字符数*/
#define FNAMELEN 80/*文件名最大字符数*/
#define BUFLEN 80/*缓冲区最大字符数*/
/*课程名称表*/
char schoolwork[SWN][NAMELEN+1]={"Chinese","Mathematic","English"};
struct record
{
char name[NAMELEN+1];/*姓名*/
char code[CODELEN+1];/*学号*/
int marks[SWN];/*各课程成绩*/
int total;/*总分*/
}stu;
struct node
{
char name[NAMELEN+1];/*姓名*/
char code[CODELEN+1];/*学号*/
int marks[SWN];/*各课程成绩*/
int total;/*总分*/
struct node*next;/*后续表元指针*/
}*head;/*链表首指针*/
int total[SWN];/*各课程总分*/
FILE*stfpt;/*文件指针*/
char stuf[FNAMELEN];/*文件名*/
/*从指定文件读入一个记录*/
int readrecord(FILE*fpt,struct record*rpt)
{
char buf[BUFLEN];
int i;
if(fscanf(fpt,"%s",buf)!=1)
return 0;/*文件结束*/
strncpy(rpt->name,buf,NAMELEN);
fscanf(fpt,"%s",buf);
strncpy(rpt->code,buf,CODELEN);
for(i=0;i<SWN;i++)
fscanf(fpt,"%d",&rpt->marks[i]);
for(rpt->total=0,i=0;i<SWN;i++)
rpt->total+=rpt->marks[i];
return 1;
}
/*对指定文件写入一个记录*/
writerecord(FILE*fpt,struct record*rpt)
{
int i;
fprintf(fpt,"%s\n",rpt->name);
fprintf(fpt,"%s\n",rpt->code);
for(i=0;i<SWN;i++)
fprintf(fpt,"%d\n",rpt->marks[i]);
return;
}
/*显示学生记录*/
displaystu(struct record*rpt)
{
int i;
printf("\nName:%s\n",rpt->name);
printf("Code:%s\n",rpt->code);
printf("Marks:\n");
for(i=0;i<SWN;i++)
printf("%-15s:%4d\n",schoolwork[i],rpt->marks[i]);
printf("Total:%4d\n",rpt->total);
}
/*计算各单科总分*/
int totalmark(char*fname)
{
FILE*fp;
struct record s;
int count,i;
if((fp=fopen(fname,"r"))==NULL)
{
printf("Can't open file%s.\n",fname);
return 0;
}
for(i=0;i<SWN;i++)
total[i]=0;
count=0;
while(readrecord(fp,&s)!=0)
{
for(i=0;i<SWN;i++)
total[i]+=s.marks[i];
count++;
}
fclose(fp);
return count;/*返回记录数*/
}
/*列表显示学生信息*/
void liststu(char*fname)
{
FILE*fp;
struct record s;
if((fp=fopen(fname,"r"))==NULL)
{
printf("Can't open file%s.\n",fname);
return;
}
while(readrecord(fp,&s)!=0)
{
displaystu(&s);
printf("\n Press ENTER to continue...\n");
while(getchar()!='\n');
}
fclose(fp);
return;
}
/*构造链表*/
struct node*makelist(char*fname)
{
FILE*fp;
struct record s;
struct node*p,*u,*v,*h;
int i;
if((fp=fopen(fname,"r"))==NULL)
{
printf("Can't open file%s.\n",fname);
return NULL;
}
h=NULL;
p=(struct node*)malloc(sizeof(struct node));
while(readrecord(fp,(struct record*)p)!=0)
{
v=h;
while(v&&p->total<=v->total)
{
u=v;
v=v->next;
}
if(v==h)
h=p;
else
u->next=p;
p->next=v;
p=(struct node*)malloc(sizeof(struct node));
}
free(p);
fclose(fp);
return h;
}
/*顺序显示链表各表元*/
void displaylist(struct node*h)
{
while(h!=NULL)
{
displaystu((struct record*)h);
printf("\n Press ENTER to continue...\n");
while(getchar()!='\n');
h=h->next;
}
return;
}
/*按学生姓名查找学生记录*/
int retrievebyn(char*fname, char*key)
{
FILE*fp;
int c;
struct record s;
if((fp=fopen(fname,"r"))==NULL)
{
printf("Can't open file%s.\n",fname);
return 0;
}
c=0;
while(readrecord(fp,&s)!=0)
{
if(strcmp(s.name,key)==0)
{
displaystu(&s);
c++;
}
}
fclose(fp);
if(c==0)
printf("The student%s is not in the file%s.\n",key,fname);
return 1;
}
/*按学生学号查找学生记录*/
int retrievebyc(char*fname, char*key)
{
FILE*fp;
int c;
struct record s;
if((fp=fopen(fname,"r"))==NULL)
{
printf("Can't open file%s.\n",fname);
return 0;
}
c=0;
while(readrecord(fp,&s)!=0)
{
if(strcmp(s.code,key)==0)
{
displaystu(&s);
c++;
break;
}
}
fclose(fp);
if(c==0)
printf("The student%s is not in the file%s.\n",key,fname);
return 1;
}
main()
{
int i,j,n;
char c;
char buf[BUFLEN];
FILE*fp;
struct record s;
clrscr();
printf("Please input the students marks record file's name:");
scanf("%s",stuf);
if((fp=fopen(stuf,"r"))==NULL)
{
printf("The file%s doesn't exit, do you want to creat it?(Y/N)",stuf);
getchar();
c=getchar();
if(c=='Y'||c=='y')
{
fp=fopen(stuf,"w");
printf("Please input the record number you want to write to the file:");
scanf("%d",&n);
for(i=0;i<n;i++)
{
printf("Input the student's name:");
scanf("%s",&s.name);
printf("Input the student's code:");
scanf("%s",&s.code);
for(j=0;j<SWN;j++)
{
printf("Input the%s mark:",schoolwork[j]);
scanf("%d",&s.marks[j]);
}
writerecord(fp,&s);
}
fclose(fp);
}
}
fclose(fp);
getchar();
/*clrscr();*/
puts("Now you can input a command to manage the records.");
puts("m: mean of the marks.");
puts("t: total of the marks.");
puts("n: search record by student's name.");
puts("c: search record by student's code.");
puts("l: list all the records.");
puts("s: sort and list the records by the total.");
puts("q: quit!");
while(1)
{
puts("Please input command:");
scanf("%c",&c);/*输入选择命令*/
if(c=='q'||c=='Q')
{
puts("\n Thank you for your using.");
break;/* q，结束程序运行*/
}
switch(c)
{
case'm':/*计算平均分*/
case'M':
if((n=totalmark(stuf))==0)
{
puts("Error!");
break;
}
printf("\n");
for(i=0;i<SWN;i++)
printf("%-15s's average is:%.2f.\n",schoolwork[i],(float)total[i]/n);
break;
case't':/*计算总分*/
case'T':
if((n=totalmark(stuf))==0)
{
puts("Error!");
break;
}
printf("\n");
for(i=0;i<SWN;i++)
printf("%-15s's total mark is:%d.\n",schoolwork[i],total[i]);
break;
case'n':/*按学生的姓名寻找记录*/
case'N':
printf("Please input the student's name you want to search:");
scanf("%s",buf);
retrievebyn(stuf,buf);
break;
case'c':/*按学生的学号寻找记录*/
case'C':
printf("Please input the student's code you want to search:");
scanf("%s",buf);
retrievebyc(stuf,buf);
break;
case'l':/*列出所有学生记录*/
case'L':
liststu(stuf);
break;
case's':/*按总分从高到低排列显示*/
case'S':
if((head=makelist(stuf))!=NULL)
displaylist(head);
break;
default: break;
}
}
}
c语言实现学生成绩管理系统
#include"stdio.h"
#include"time.h"
#include"stdlib.h"
#include"string.h"
#define N 100
void zhuomian();
void csh(struct stu*a,int n);
void csh1(struct stu*a,int n);
void input(struct stu*a,int n);
void output(struct stu*a,int n);
void npaixu(struct stu*a,int n);
void spaixu(struct stu*a,int n);
void Cpaixu(struct stu*a,int n);
void Apaixu(struct stu*a,int n);
void Dpaixu(struct stu*a,int n);
void shousu(struct stu*a,int n);
void shanchu(struct stu*a,int n);
void xiugai(struct stu*a,int n);
void baocun(struct stu*a,int n);
void duqu(struct stu*a,int n);
void tuichu();
char ymi[8]="12345678";
static int m=0;
struct stu
{
char name[20];
char num[20];
char sex;
int age;
float score[3];
float sum;
float averge;
};
void main()
{
int i,a,c;
int f=0,m=0;
char mi[20];
struct stu b[N];
do
{
printf("\n\n\n");
printf("\t************************\n");
printf("\t**\n");
printf("\t*学生管理系统*\n");
printf("\t**\n");
printf("\t*欢迎使用！！*\n");
printf("\t**\n");
printf("\t************************\n");
printf("\t注：输入密码的长度小于20位数，否择自动登陆!\n");
printf("\t请输入管理员密码：");
for(i=0;i<20;i++)
{
mi[i]=getch();
printf("*");
if(mi[i]=='\x0d')
{
mi[i]='\0';
break;
}
}
printf("\n\t请稍后，正在登陆进入系统");
for(i=0;i<15;i++)
{
printf(".");
_sleep(250);
}
if(strcmp(mi,ymi)==0)
{
f=1;
printf("\n\t密码正确，马上进入系统!\n");
for(i=0;i<10;i++)
{
printf("\t");
_sleep(150);
}
break;
}
else
{
system("cls");
printf("\n密码错误，请重新输入!\n");
m++;
}
}while(m<3);
if(f==0)
{
printf("你已经连续3次输入错误，任意键自动退出\n");
exit(0);
}
system("cls");
while(1)
{
zhuomian();
scanf("%d",&a);
getchar();
switch(a)
{
case 1:
{
system("cls");
csh(b,N);
}break;
case 2:
{
do
{
system("cls");
printf("\t\t\t******************\n");
printf("\t\t\t*<1>按学号排列！！*\n");
printf("\t\t\t*<2>按总分排列！！*\n");
printf("\t\t\t*<3>按C语言排序！！*\n");
printf("\t\t\t*<4>按Access排序！！*\n");
printf("\t\t\t*<5>按Dreamweaver排序！！*\n");
printf("\t\t\t*<0>返回上一层！*\n");
printf("\t\t\t*请选择（0~5）:*\n");
printf("\t\t\t******************\n");
scanf("\t\t\t%d",&c);
switch(c)
{
case 1:
{
system("cls");
npaixu(b,N);
output(b,N);
printf("任意键退出....");
getch();
}break;
case 2:
{
system("cls");
spaixu(b,N);
output(b,N);
printf("任意键退出....");
getch();
}break;
case 3:
{
system("cls");
Cpaixu(b,N);
output(b,N);
printf("任意键退出....");
getch();
}break;
case 4:
{
system("cls");
Apaixu(b,N);
output(b,N);
printf("任意键退出....");
getch();
}break;
case 5:
{
system("cls");
Dpaixu(b,N);
output(b,N);
printf("任意键退出....");
getch();
}break;
case 0:system("cls");break;
default:system("cls");break;
}
}while(c!=0);
}break;
case 3:
{
system("cls");
shousu(b,N);
}break;
case 4:
{
system("cls");
output(b,N);
printf("任意键退出....");
getch();
}break;
case 5:
{
system("cls");
input(b,N);
printf("增加记录完毕!!\n");
}break;
case 6:
{
system("cls");
shanchu(b,N);
}break;
case 7:
{
system("cls");
xiugai(b,N);
}break;
case 8:
{
baocun(b,N);
}break;
case 9:
{
duqu(b,N);
}break;
case 0:tuichu();break;
default:printf("不存在,请选择(0~9)!!\n");break;
}
}
}
void zhuomian()
{
system("cls");
printf("\n\n\n");
printf("\t\t+--------------------------------------------+\n");
printf("\t\t|学生成绩管理系统|\n");
printf("\t\t+--------------------------------------------+\n");
printf("\t\t| 1、初始化或追加一条记录|\n");
printf("\t\t+--------------------------------------------+\n");
printf("\t\t| 2、按排序输出|\n");
printf("\t\t| 3、收索记录|\n");
printf("\t\t| 4、浏览记录（不排序）|\n");
printf("\t\t+--------------------------------------------+\n");
printf("\t\t| 5、插入记录 6、删除记录|\n");
printf("\t\t| 7、修改记录|\n");
printf("\t\t+--------------------------------------------+\n");
printf("\t\t| 8、保存记录 9、读取记录|\n");
printf("\t\t| 0、退出|\n");
printf("\t\t+--------------------------------------------+\n");
printf("\t\t请选择（0~9）：");
}
void csh(struct stu*a,int n)
{
int i,c=0;
int h=0;
for(i=m;i>0;i--)
{
a[i]=a[i+1];
m--;
}
printf("初始化完毕！是否增加新记录(1/0)！");
scanf("%d",&c);
if(c==1)
{
for(i=m;i<n;i++)
{
printf("请输入学号:\n");
scanf("%s",a[i].num);
printf("姓名:\n");
scanf("%s",a[i].name);
printf("性别(b/g):\n");
scanf("%c",&a[i].sex);
printf("年龄:\n");
scanf("%d",&a[i].age);
a[i].sum=0;
printf("C语言的成绩:\n");
scanf("%f",&a[i].score[0]);
printf("Access的成绩:\n");
scanf("%f",&a[i].score[1]);
printf("Dreamweaver的成绩:\n");
scanf("%f",&a[i].score[2]);
a[i].sum=a[i].sum+a[i].score[0]+a[i].score[1]+a[i].score[2];
a[i].averge=a[i].sum/3;
m++;
printf("请输入1继续0结束！！\n");
scanf("%d",&h);
if(h==1)
continue;
else
break;
}
}
}
void input(struct stu*a,int n)
{
int i;
int h=0;
for(i=m;i<n;i++)
{
printf("请输入学号:\n");
scanf("%s",a[i].num);
printf("姓名:\n");
scanf("%s",a[i].name);
printf("性别(b/g):\n");
scanf("%c",&a[i].sex);
printf("年龄:\n");
scanf("%d",&a[i].age);
a[i].sum=0;
printf("C语言的成绩:\n");
scanf("%f",&a[i].score[0]);
printf("Access的成绩:\n");
scanf("%f",&a[i].score[1]);
printf("Dreamweaver的成绩:\n");
scanf("%f",&a[i].score[2]);
a[i].sum=a[i].sum+a[i].score[0]+a[i].score[1]+a[i].score[2];
a[i].averge=a[i].sum/3;
m++;
printf("请输入1继续0结束！！\n");
scanf("%d",&h);
if(h==1)
continue;
else
break;
}
}
void output(struct stu*a,int n)
{
int i;
int j;
printf("****************************************\n");
printf("学号\t姓名\t性别\t年龄\tc语言\tAccess\tDreamweaver\t总分\t平均分\n");
for(i=0;i<m;i++)
{
printf("%s\t",a[i].num);
printf("%s\t",a[i].name);
printf("%c\t",a[i].sex);
printf("%d\t",a[i].age);
for(j=0;j<3;j++)
{
printf("%.1f\t",a[i].score[j]);
}
printf("\t%.1f\t%.1f",a[i].sum,a[i].averge);
printf("\n");
}
printf("****************************************\n");
}
void npaixu(struct stu*a,int n)
{
int i,j;
struct stu temp;
for(i=1;i<=m-1;i++)
{
for(j=0;j<=m-i-1;j++)
{
if(strcmp(a[j].num,a[j+1].num)>0)
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
}
void spaixu(struct stu*a,int n)
{
int i,j;
struct stu temp;
for(i=1;i<=m-1;i++)
{
for(j=0;j<=m-i-1;j++)
{
if(a[j].sum<a[j+1].sum)
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
}
void Cpaixu(struct stu*a,int n)
{
int i,j;
struct stu temp;
for(i=1;i<=m-1;i++)
{
for(j=0;j<=m-i-1;j++)
{
if(a[j].score[0]<a[j+1].score[0])
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
}
void Apaixu(struct stu*a,int n)
{
int i,j;
struct stu temp;
for(i=1;i<=m-1;i++)
{
for(j=0;j<=m-i-1;j++)
{
if(a[j].score[1]<a[j+1].score[1])
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
}
void Dpaixu(struct stu*a,int n)
{
int i,j;
struct stu temp;
for(i=1;i<=m-1;i++)
{
for(j=0;j<=m-i-1;j++)
{
if(a[j].score[2]<a[j+1].score[2])
{
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
}
void shousu(struct stu*a,int n)
{
char snum[20];
int i,j,d=0;
do
{
printf("请输入你要查找的学号\n");
scanf("%s",snum);
for(i=0;i<m;i++)
{
if(strcmp(a[i].num,snum)==0)
{
printf("****************************************\n");
printf("学号\t姓名\t性别\t年龄\tc语言\tAccess\tDreamweaver\t总分\t平均分\n");
printf("%s\t",a[i].num);
printf("%s\t",a[i].name);
printf("%c\t",a[i].sex);
printf("%d\t",a[i].age);
for(j=0;j<3;j++)
{
printf("%.1f\t",a[i].score[j]);
}
printf("\t%.1f\t%.1f",a[i].sum,a[i].averge);
printf("\n");
printf("****************************************\n");
printf("收索成功\n");
break;
}
}
if(i==m)
{
printf("你输入的学号不存在！\n");
}
printf("是否继续查询？(1/0)\n");
scanf("%d",&d);
system("cls");
}while(d==1);
}
void shanchu(struct stu*a,int n)
{
int c=0;
int i,j,d;
char snum[20];
do
{
printf("请输入要删除的学号\n");
scanf("%s",snum);
for(i=0;i<n;i++)
{
if(strcmp(a[i].num,snum)==0)
{
printf("学号\t姓名\t性别\t年龄\tc语言\tAccess\tDreamweaver\t总分\t平均分\n");
printf("%s\t",a[i].num);
printf("%s\t",a[i].name);
printf("%c\t",a[i].sex);
printf("%d\t",a[i].age);
for(j=0;j<3;j++)
{
printf("%.1f\t",a[i].score[j]);
}
printf("\t%.1f\t%.1f",a[i].sum,a[i].averge);
printf("\n");
printf("是否删除此记录(1/0)\n");
scanf("%d",&c);
if(c==1)
{
a[i]=a[i+1];
m--;
printf("删除成功!\n");break;
}
else
break;
}
}
if(i==n)
{
printf("你输入的学号不存在!\n");
}
if(c==1)
{
printf("是否继续删除1继续0退出(1/0)!\n");
scanf("%d",&d);
system("cls");
}
}while(d==1);
}
void xiugai(struct stu*a,int n)
{
int i,j,c=0,d,f=0;
char snum[20];
float xscore[3];
char xn[20];
do
{
printf("请输入要修改的学号\n");
scanf("%s",snum);
for(i=0;i<m;i++)
{
if(strcmp(a[i].num,snum)==0)
{
printf("学号\t姓名\t性别\t年龄\tc语言\tAccess\tDreamweaver\t总分\t平均分\n");
printf("%s\t",a[i].num);
printf("%s\t",a[i].name);
printf("%c\t",a[i].sex);
printf("%d\t",a[i].age);
for(j=0;j<3;j++)
{
printf("%.1f\t",a[i].score[j]);
}
printf("\t%.1f\t%.1f",a[i].sum,a[i].averge);
printf("\n");
printf("是否修改此记录(1/0)\n");
scanf("%d",&c);
if(c==1)
{
do
{
system("cls");
printf("\t\t请选者你要修改的记录，0返回上级菜单\n");
printf("\t********************************\n");
printf("\t*<1> c语言<2> Access*\n");
printf("\t*<3> Dreamweaver<4>姓名*\n");
printf("\t********************************\n");
scanf("%d",&d);
switch(d)
{
case 1:
{
printf("请输入修改的成绩\n");
scanf("%f",&xscore[0]);
a[i].score[0]=xscore[0];
printf("修改成功!\n");
printf("任意键返回上级菜单....");
getch();
}break;
case 2:
{
printf("请输入修改的成绩\n");
scanf("%f",&xscore[1]);
a[i].score[1]=xscore[1];
printf("修改成功!\n");
printf("任意键返回上级菜单....");
getch();
}break;
case 3:
{
printf("请输入修改的成绩\n");
scanf("%f",&xscore[2]);
a[i].score[2]=xscore[2];
printf("修改成功!\n");
printf("任意键返回上级菜单....");
getch();
}break;
case 4:
{
printf("\t\t请输入修改的姓名\n");
scanf("\t\t%s",xn);
strcpy(a[i].name,xn);
printf("修改成功!\n");
printf("任意键返回上级菜单....");
getch();
}break;
case 0:break;
default:printf("\t\t不存在,请选择(1~4)!!\n");break;
}
}while(d!=0);break;
}
}
}
if(i==m)
{
printf("你输入的学号不存在!是否继续修改(1/0)！\n");
scanf("%d",&f);
}
}while(f==1);
}
void baocun(struct stu*a,int n)//保存记录
{
int i,c=0;
FILE* fp;
system("cls");
output(a,n);
printf("是否保存改记录(1/0)");
scanf("%d",&c);
if(c==1)
{
if((fp=fopen("d:\zhang.txt","w+"))==NULL)
printf("无发打开\n");
else
{
fprintf(fp,"学号\t姓名\t性别\t年龄\tc语言\tAccess\tDreamweaver\t总分\t平均分\n");
for(i=0;i<m;i++)
{
fprintf(fp,"%s\t",a[i].num);
fprintf(fp,"%s\t",a[i].name);
fprintf(fp,"%c\t",a[i].sex);
fprintf(fp,"%d\t",a[i].age);
fprintf(fp,"%.1f\t",a[i].score[0]);
fprintf(fp,"%.1f\t",a[i].score[1]);
fprintf(fp,"%.1f\t",a[i].score[2]);
fprintf(fp,"%.1f\t",a[i].averge);
fprintf(fp,"%.1f\t",a[i].sum);
fprintf(fp,"\n");
}
fclose(fp);
printf("保存成功!\n请稍后，系统自动返回!!\n");
for(i=0;i<10;i++)
{
printf("\t");
_sleep(150);
}
}
}
}
void duqu(struct stu*a,int n)
{
int i;
FILE* fp;
system("cls");
if((fp=fopen("d:\zhang.txt","r"))==NULL)
printf("不能打开此文件\n");
fseek(fp,58L,0);
while(!feof(fp))
{
fscanf(fp,"%s\t",a[m].num);
fscanf(fp,"%s\t",a[m].name);
fscanf(fp,"%c\t",&a[m].sex);
fscanf(fp,"%d\t",&a[m].age);
fscanf(fp,"%f\t",&a[m].score[0]);
fscanf(fp,"%f\t",&a[m].score[1]);
fscanf(fp,"%f\t",&a[m].score[2]);
fscanf(fp,"%f\t",&a[m].averge);
fscanf(fp,"%f\t",&a[m].sum);
m++;
}
fclose(fp);
printf("读取成功!\n请稍后，系统自动返回!!\n");
for(i=0;i<10;i++)
{
printf("\t");
_sleep(150);
}
}
void tuichu()
{
system("cls");
printf("\n\n");
printf("\t\t*********************\n");
printf("\t\t*欢迎使用学生管理系统，任意键退出！*\n");
printf("\t\t*********************\n");
exit(0);
}虽然只有50分，但我也给你啦！我刚做好的呢！因为我们老师也叫我们做！觉得满意吧！！
OK，关于大一c语言学生成绩管理系统和大一c语言编程题库100题的内容到此结束了，希望对大家有所帮助。