文档介绍：学生成绩管理源代码
#include<> #include<> #include<> #include<> #define Longest 30 #define Numlong 11 #define Sexlong 5 int shoudsave=0; struct student
{
char num[Numlong]; char name[25];
char sex[Sexlong]; int test;
int middle; int dayly; int total;
int average; char neartime[10];
}；
typedef struct node
{
struct student data; struct node *next; }Node,*Link;
void menu()
printf(*
**\iT);
printf(n *\tl>Add Records printf(n*\t3>Find Out printf(n *\t5>Sort Records printf(1 * *\t7>Display Records printf(H*\t9>Help
2>Delete Records \t\t\t *\nn); 4>Modify Records \t\t\t 6>Save Records \t\t\t\t *\nu); 8>Tongji\t\t\t\t*\nH);
0>Exit System \t\t\t\t *\n‘‘)；
void printstart()
{
printf(n -\nn);
}
void Wrong()
{
printf(n=====>Input error!\nH);
}
void Continue()
{
printf(**=====>Please press any key to continue.\nH);
getch();
}
void Nofind()
{
printf(**\n=====>Not find records !\nH);
}
void printc()
{
printf(u number name sex dayly middle test total
aver\nn);
}
void printe(Node *p)
{
printf(n%-10s %-25s%-5s%5d %5d %5d %5d %5d\nn,p->,p->,p->data
・sex，p ・> ,p ・> ,p->,p->,p->);
}
Node* Locate(Link l,char findmess[],char nameornum[])
{
Node *r;
if(strcmp(nameornum/* num H)==0)
{
r=l->next;
while(r!=NULL)
{
if(strcmp(r->,findmess)==O)
return r;
r=r->next;
}
}
else if(strcmp(nameornum,nnameH)==0)
r=l->next;
while(r!=NULL)
if(strcmp(r->,findmess)==O)
return r;
r=r->next;
}
}
return 0;
}
void Add(Link 1)
{
Node *p,*r,*s;
char num[Numlong];
r=l;
s=l->next;
while(r->next!=NULL)
r=r->next;
while(l)
{
printf(HPlease input 10 number(Input *0* to exit.):**);
scanf(n%sn,num);
if(strcmp(num/*0n )==0)
{
Continue();
break;
}
while(s)
{
if(strcmp(s->,num)==O)
{
printf(n=====>The number *%s* is in the file.(Input *4* to modify !)\nn,num); printstart();
printc();
printe(s);
printstart();
C