问大圣之怒神将怎么进阶 神将进阶技巧介绍

展开全部#include"stdio.h
include"stdlib.h
include"string.h
include"windows.h
int shouds**e=0;struct student
{
char num[10];学号*/
char name[20];char sex[4];int cgrade;int mgrade;int egrade;int totle;int **e;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.**e);}
node*locate(link l,char findmess[],char nameornum[])/*该函数用于定位连表中符合要求的接点，并返回该指针*/
{
node*r;if(strcmp(nameornum,"num")=0)/*按学号查询*/
{
r=l->next;while(r!**)
{
if(strcmp(r->data.num,findmess)=0)
return r;r=r->next;}
}
else if(strcmp(nameornum,"name")=0)/*按姓名查询*/
{
r=l->next;while(r!**)
{
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!**)
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.**e=p->data.totle/3;信息输入已经完成*/
p->next=**;r->next=p;r=p;shouds**e=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");shouds**e=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");shouds**e=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.**e=p->data.totle/3;printf("\n=>提示:资料修改成功!\n");shouds**e=1;}
else
nofind();}
void d**p(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!**)
{
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.**e>=pa->data.**e)
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.**e);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=**;if(l->next=**)
{
printf("\n=>提示:没有资料可以排序!\n");return;}
p=l->next;while(p)
{
s=(node*)malloc(sizeof(node));新建接点用于保存信息*/
s->data=p->data;s->next=**;rr=ll;while(rr->next!**&rr->next->data.totle>=p->data.totle)
rr=rr->next;if(rr->next=**)
rr->next=s;else
{
s->next=rr->next;rr->next=s;...