C语言学生成绩管理系统.docx

学生信息包括：学号，姓名，年龄，入学成绩和学院等。学生信息管理系统的功能如下： 1. 系统以菜单方式工作 2. 学生信息录入功能（学生信息保存在文件里，student_info.txt） 3. 按学号排序 4. 按入学成绩排序 5. 按学号查询 6. 按姓名号查询 7. 按学院统计人数#include stdio.h#define SIZE 50int sum=0;static char *str=C,Math,English;struct student int n; long num; char name10; int age; char addr10; int score3; float avr; stuSIZE;/* 1-Input */void fin() int i,j,s;char f; FILE *fp; printf( Warring! Input? ( y/n ) : 777); f=getchar();f=getchar(); if(f!=y) return; fp=fopen(fstu,wb); for(i=0;iSIZE;i+) printf( i=%d Input No. (i=-1,return) i=? ,i+1); scanf(%d,&j); if (j=-1) printf(n * * * Press any key return! * * *n,j); fclose(fp);getch();return; else printf( Input num,name,age,addr : ); stui.n=i+1; scanf(%ld%s%d%s,&stui.num,,&stui.age,stui.addr); s=0; for(j=0;j100) j-;continue; s+=stui.scorej; stui.avr=s/3.0; fwrite(&stui,sizeof(struct student),1,fp); fclose(fp);/* 2-Find */void ffind() int i,j; FILE *fp; fp=fopen(fstu,rb); for(i=0;fread(&stui,sizeof(struct student),1,fp)!=0;i+); sum=i; rewind(fp); printf( * * * Find student data * * *n); printf( Input n=1 - %d : ,sum); scanf(%d,&j); fseek(fp,(j-1)*sizeof(struct student),0); printf(n Display student %d data : n,j); printf( * * * * * * * * * * * * * * * * * * * * * * * * * * *n); printf( No. Num Name Age Addr C Math En. Aver.n); printf( -n); fread(&stui,sizeof(struct student),1,fp); printf(%12d%7ld %-10s%2d %-10s,stui.n,stui.num,,stui.age,stui.addr); printf(%3d %3d %3d %6.2fn,stui.score0,stui.score1,stui.score2,stui.avr); fclose(fp); printf( * * * * * * * * * * * * * * * * * * * * * * * * * * *nn); printf(nn);getch();/* 3-Change */void fchan() int i,j,s,m;char ch; FILE *fp; for(;) fp=fopen(fstu,rb+); for(i=0;fread(&stui,sizeof(struct student),1,fp)!=0;i+); sum=i; printf( * * * Change student data * * *n); printf( Input n=1 - %d : ,sum); scanf(%d,&j); m=j-1; fseek(fp,m*sizeof(struct student),0); printf(n Display student %d data : n,j); printf( * * * * * * * * * * * * * * * * * * * * * * * * * * *n); printf( No. Num Name Age Addr C Math En. Aver.n); printf( -n); fread(&stui,sizeof(struct student),1,fp); printf(%12d%7ld %-10s%2d %-10s,stui.n,stui.num,,stui.age,stui.addr); printf(%3d %3d %3d %6.2fn,stui.score0,stui.score1,stui.score2,stui.avr); fclose(fp); printf( * * * * * * * * * * * * * * * * * * * * * * * * * * *nn); fclose(fp);printf(nn);getch(); fp=fopen(fstu,rb+); for(i=0;fread(&stui,sizeof(struct student),1,fp)!=0;i+); sum=i; printf( * * * Change student %d data * * *n,j); fseek(fp,m*sizeof(struct student),0); printf( i=%d Input No. (i=-1,return) i=? ,j); scanf(%d,&j); if (j=-1) printf(n * * * Press any key return! * * *n,j); fclose(fp);getch();return; else printf( Input num,name,age,addr : ); stui.n=j; scanf(%ld%s%d%s,&stui.num,,&stui.age,stui.addr); s=0; for(j=0;j100) j-;continue; s+=stui.scorej; stui.avr=s/3.0; rewind(fp); fseek(fp,m*sizeof(struct student),0); fwrite(&stui,sizeof(struct student),1,fp); fclose(fp); printf(n * * * Continue ( y/n ) ? * * *n,j); ch=getchar(); if(ch!=y) return; /* 4-Append */void fappe() int i,j,s; FILE *fp; fp=fopen(fstu,ab+); for(i=0;fread(&stui,sizeof(struct student),1,fp)!=0;i+); sum=i; rewind(fp); printf( List student datas : nn); printf( * * * * * * * * * * * * * * * * * * * * * * * * * * *n); printf( No. Num Name Age Addr C Math En. Aver.n); printf( -n); for(i=0;fread(&stui,sizeof(struct student),1,fp)!=0;i+) printf(%12d%7ld %-10s%2d %-10s,stui.n,stui.num,,stui.age,stui.addr); printf(%3d %3d %3d %6.2fn,stui.score0,stui.score1,stui.score2,stui.avr); printf( * * * * * * * * * * * * * * * * * * * * * * * * * * *nn); getch(); sum=i; for(i=sum;iSIZE;i+) printf( i=%d Input No. (i=-1,return) i=? ,i+1); scanf(%d,&j); if (j=-1) printf(n * * * Press any key return! * * *n,j); fclose(fp);getch();return; else printf( Input num,name,age,addr : ); stui.n=i+1; scanf(%ld%s%d%s,&stui.num,,&stui.age,stui.addr); s=0; for(j=0;j100) j-;continue; s+=stui.scorej; stui.avr=s/3.0; fwrite(&stui,sizeof(struct student),1,fp); fclose(fp);/* 5-List */void flist() int i; FILE *fp; fp=fopen(fstu,rb); for(i=0;fread(&stui,sizeof(struct student),1,fp)!=0;i+); sum=i; rewind(fp); printf( List student datas : nn); printf( * * * * * * * * * * * * * * * * * * * * * * * * * * *n); printf( No. Num Name Age Addr C Math En. Aver.n); printf( -n); for(i=0;fread(&stui,sizeof(struct student),1,fp)!=0;i+) printf(%12d%7ld %-10s%2d %-10s,stui.n,stui.num,,stui.age,stui.addr); printf(%3d %3d %3d %6.2fn,stui.score0,stui.score1,stui.score2,stui.avr); fclose(fp); printf( * * * * * * * * * * * * * * * * * * * * * * * * * * *nn); getch();/* 6-Sort */void fsort() int i,j,n; FILE *fp; struct student t; fp=fopen(fstu,rb); printf( List fstu file data : n); printf( * * * * * * * * * * * * * * * * * * * * * * * * * * *n); printf( No. Num Name Age Addr C Math En. Aver.n); printf( -n); for(i=0;fread(&stui,sizeof(struct student),1,fp)!=0;i+) printf(%12d%7ld %-10s%2d %-10s,stui.n,stui.num,,stui.age,stui.addr); printf(%3d %3d %3d %6.2fn,stui.score0,stui.score1,stui.score2,stui.avr); printf( * * * * * * * * * * * * * * * * * * * * * * * * * * *nn); getch(); n=i; for(i=0;in;i+) for(j=i+1;jn;j+) if(stui.avrstuj.avr) t=stui; stui=stuj; stuj=t; fp=fopen(fstus,wb); printf( List sort fstus file data : n); printf( * * * * * * * * * * * * * * * * * * * * * * * * * * *n); printf( No. Num Name Age Addr C Math En. Aver.n); printf( -n); for(i=0;in;i+) fwrite(&stui,sizeof(struct student),1,fp); printf(%12d%7ld %-10s%2d %-10s,stui.n,stui.num,,stui.age,stui.addr); printf(%3d %3d %3d %6.2fn,stui.score0,stui.score1,stui.score2,stui.avr); printf( * * * * * * * * * * * * * * * * * * * * * * * * * * *nn); printf(n);getch(); for(i=0;fread(&stui,sizeof(struct student),1,fp)!=0;i+) fwrite(&stui,sizeof(struct student),1,fp); fclose(fp);/* 7-Copy */void fcopy() int i; FILE *fp1,*fp2; fp1=fopen(fstu,rb); fp2=fopen(fstub,wb); printf( List fstu file data : n); printf( * * * * * * * * * * * * * * * * * * * * * * * * * * *n); printf( No. Num Name Age Addr C Math En. Aver.n); printf( -n); for(i=0;fread(&stui,sizeof(struct student),1,fp1)!=0;i+) printf(%12d%7ld %-10s%2d %-10s,stui.n,stui.num,,stui.age,stui.addr); printf(%3d %3d %3d %6.2fn,stui.score0,stui.score1,stui.score2,stui.avr); fwrite(&stui,sizeof(struct student),1,fp2); fclose(fp2); printf( * * * * * * * * * * * * * * * * * * * * * * * * * * *nn); printf(n);getch(); for(i=0;fread(&stui,sizeof(struct student),1,fp1)!=0;i+) fwrite(&stui,sizeof(struct student),1,fp2); fclose(fp1); fclose(fp2); fp2=fopen(fstub,rb); printf( List backup fstub file data : n); printf( * * * * * * * * * * * * * * * * * * * * * * * * * * *n); printf( No. Num Name Age Addr C Math En. Aver.n); printf( -n); for(i=0;fread(&stui,sizeof(struct student),1,fp2)!=0;i+) printf(%12d%7ld %-10s%2d %-10s,stui.n,stui.num,,stui.age,stui.addr); printf(%3d %3d %3d %6.2fn,stui.score0,stui.score1,stui.score2,stui.avr); fclose(fp2); printf( * * * * * * * * * * * * * * * * * * * * * * * * * * *nn); getch();printf(n);/* 8-Restore */void frest() int i; FILE *fp1,*fp2; fp1=fopen(fstub,rb); fp2=fopen(fstu,wb); printf( List backup fstub file data : n); printf( * * * * * * * * * * * * * * * * * * * * * * * * * * *n); printf( No. Num Name Age Addr C Math En. Aver.n); printf( -n); for(i=0;fread(&stui,sizeof(struct student),1,fp1)!=0;i+) printf(%12d%7ld %-10s%2d %-10s,stui.n,stui.num,,stui.age,stui.addr); printf(%3d %3d %3d %6.2fn,stui.score0,stui.score1,stui.score2,stui.avr); fwrite(&stui,sizeof(struct student),1,fp2); fclose(fp1); printf( * * * * * * * * * * * * * * * * * * * * * * * * * * *nn); printf(n);getch(); for(i=0;fread(&stui,sizeof(struct student),1,fp1)!=0;i+) fwrite(&stui,sizeof(struct student),1,fp2); fclose(fp1); fclose(fp2); fp2=fopen(fstu,rb); printf( List fstu file data : n); printf( * * * * * * * * * * * * * * * * * * * * * * * * * * *n); printf( No. Num Name Age Addr C Math En. Aver.n); printf( -n); for(i=0;fread(&stui,sizeof(struct student),1,fp2)!=0;i+) printf(%12d%7ld %-10s%2d %-10s,stui.n,stui.num,,stui.age,stui.addr); printf(%3d %3d %3d %6.2fn,stui.score0,stui.score1,stui.score2,stui.avr); fclose(fp2); printf( * * * * * * * * * * * * * * * * * * * * * * * * * * *nn); getch();printf(n);main() int n; for(;) printf(nnnnnnnnnnnn); printf( * * * * * * * * * * * * * * * * * *n); printf( * Student M I S *n); printf( * * * * * * * * * * * * * * * * * *n); printf( * 1. Input student data *n); printf( * 2. Find student data *n); printf( * 3. Change st