C语言设计一个学生学籍管理系统，要求文件形式保存，且用到链表 如何用c语言制作一个学生信息管理系统,要求以文件形式保存
\u7528C\u8bed\u8a00\u8bbe\u8ba1\u4e00\u4e2a\u5b66\u751f\u5b66\u7c4d\u7ba1\u7406\u7cfb\u7edf\uff0c\u8981\u6c42\u7528\u5230\u6587\u4ef6\u5b58\u653e\u5b66\u7c4d\u4fe1\u606f\uff0c\u542b\u6709\u94fe\u8868\u3002\u5230CSDN\u4e0b\u8f7d\u9891\u9053\u641c\u4e00\u4e0bC\u8bed\u8a00\u8bfe\u8bbe\u5b66\u751f\u4fe1\u606f\u7ba1\u7406\u7cfb\u7edf\uff0c\u6216\u8005\u767e\u5ea6\u4e00\u4e0b\uff0c\u57fa\u672c\u4e0a\u5927\u5b66\u7684C\u8bed\u8a00\u8bfe\u8bbe\u5f88\u591a\u90fd\u662f\u8fd9\u4e2a\uff0c\u6709\u4eba\u5171\u4eab\u7684
#include
#include
#include
//\u94fe\u8868\u7ed3\u70b9\u7ed3\u6784\u4f53\u58f0\u660e
typedef struct subjects
{
char name[20];
float score;
}sub;
typedef struct student
{
int num;
char name[20];
sub subject[3];
struct student* next;
}stu,*pstu;
#define SIZE sizeof(stu)
//\u51fd\u6570\u7533\u660e
pstu LoadInfo();
void PrintMenu();
pstu AddStu(pstu );
pstu DeleStu(pstu );
pstu RwrStu(pstu );
void FindStu(pstu , char );
void Count(pstu ,char * ,float ,float );
void Rank(pstu ,char * );
void SaveQuit(pstu );
//\u521b\u5efa\u83dc\u5355\uff0c\u8fdb\u5165\u9009\u62e9\u5faa\u73af
while(1)
{
PrintMenu();
printf("\u8bf7\u8f93\u5165\u60a8\u7684\u9009\u62e9\u7f16\u53f7\uff1a");
scanf("%d",&n);
getchar();
switch(n)
{
case 1:
{
system("cls");
j=0;
while(4!=j)
{
printf("\u6b22\u8fce\u8fdb\u5165\u4fe1\u606f\u7ba1\u7406\u7248\u5757\uff01\n\n");
printf("\025 1\u3001\u6dfb\u52a0\u5b66\u751f\n");
printf("\025 2\u3001\u5220\u9664\u5b66\u751f\n");
printf("\025 3\u3001\u4fee\u6539\u5b66\u751f\u4fe1\u606f\n");
printf("\025 4\u3001\u8fd4\u56de\n");
printf("\u8bf7\u8f93\u5165\u60a8\u7684\u9009\u62e9\u7f16\u53f7\uff1a\n");
scanf("%d",&j);
getchar();
if ( 1 == j) head = AddStu(head);
else if( 2 == j) head = DeleStu(head);
else if( 3 == j) head = RwrStu(head);
else if( 4 == j) ;
else printf("\u8f93\u5165\u6709\u8bef,\u8bf7\u91cd\u65b0\u8f93\u5165!\n");
}
case 2:
{
//\u4fe1\u606f\u67e5\u8be2
system("cls");
printf("\u6b22\u8fce\u8fdb\u5165\u4fe1\u606f\u67e5\u8be2\u7248\u5757!\n");
printf("\u8bf7\u8f93\u5165\u8981\u67e5\u8be2\u7684\u5b66\u751f\u7f16\u53f7\uff1a");
scanf("%d",&j);
getchar();
//printf("%d\n",j); //\u68c0\u6d4b\u8f93\u5165\u662f\u5426\u6210\u529f,\u8c03\u8bd5\u7a0b\u5e8f\u7528
FindStu(head,j); //\u67e5\u8be2\u5e76\u8f93\u51fa
printf("\n\u8bf7\u8f93\u5165\u56de\u8f66\u952e\u8fd4\u56de\u4e3b\u83dc\u5355\uff01");
getchar();
system("cls");
break;
}
\u6269\u5c55\u8d44\u6599\uff1a
C\u8bed\u8a00\u5305\u542b\u7684\u5404\u79cd\u63a7\u5236\u8bed\u53e5\u4ec5\u67099\u79cd\uff0c\u5173\u952e\u5b57\u4e5f\u53ea\u670932 \u4e2a\uff0c\u7a0b\u5e8f\u7684\u7f16\u5199\u8981\u6c42\u4e0d\u4e25\u683c\u4e14\u4ee5\u5c0f\u5199\u5b57\u6bcd\u4e3a\u4e3b\uff0c\u5bf9\u8bb8\u591a\u4e0d\u5fc5\u8981\u7684\u90e8\u5206\u8fdb\u884c\u4e86\u7cbe\u7b80\u3002
\u5b9e\u9645\u4e0a\uff0c\u8bed\u53e5\u6784\u6210\u4e0e\u786c\u4ef6\u6709\u5173\u8054\u7684\u8f83\u5c11\uff0c\u4e14C\u8bed\u8a00\u672c\u8eab\u4e0d\u63d0\u4f9b\u4e0e\u786c\u4ef6\u76f8\u5173\u7684\u8f93\u5165\u8f93\u51fa\u3001\u6587\u4ef6\u7ba1\u7406\u7b49\u529f\u80fd\uff0c\u5982\u9700\u6b64\u7c7b\u529f\u80fd\uff0c\u9700\u8981\u901a\u8fc7\u914d\u5408\u7f16\u8bd1\u7cfb\u7edf\u6240\u652f\u6301\u7684\u5404\u7c7b\u5e93\u8fdb\u884c\u7f16\u7a0b\uff0c\u6545c\u8bed\u8a00\u62e5\u6709\u975e\u5e38\u7b80\u6d01\u7684\u7f16\u8bd1\u7cfb\u7edf\u3002
\u53c2\u8003\u8d44\u6599\u6765\u6e90\uff1a\u767e\u5ea6\u767e\u79d1-c\u8bed\u8a00
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
//链表结点结构体声明
typedef struct subjects
{
char name[20];
float score;
}sub;
typedef struct student
{
int num;
char name[20];
sub subject[3];
struct student* next;
}stu,*pstu;
#define SIZE sizeof(stu)
//函数申明
pstu LoadInfo();
void PrintMenu();
pstu AddStu(pstu );
pstu DeleStu(pstu );
pstu RwrStu(pstu );
void FindStu(pstu , char );
void Count(pstu ,char * ,float ,float );
void Rank(pstu ,char * );
void SaveQuit(pstu );
//主函数
int main()
{
float score1,score2;
char n,j;
char subname[20];
pstu head,ptr;
head = LoadInfo();
ptr = head->next;
//创建菜单，进入选择循环
while(1)
{
PrintMenu();
printf("请输入您的选择编号：");
scanf("%d",&n);
getchar();
switch(n)
{
case 1:
{
system("cls");
j=0;
while(4!=j)
{
printf("欢迎进入信息管理版块！
");
printf("\025 1、添加学生
");
printf("\025 2、删除学生
");
printf("\025 3、修改学生信息
");
printf("\025 4、返回
");
printf("请输入您的选择编号：
");
scanf("%d",&j);
getchar();
if ( 1 == j) head = AddStu(head);
else if( 2 == j) head = DeleStu(head);
else if( 3 == j) head = RwrStu(head);
else if( 4 == j) ;
else printf("输入有误,请重新输入!
");
}
printf("请输入回车键返回主菜单！"); //此处本意按任意键返回，但是任意键的话，需要按键A，再按回车确定
getchar(); //则会连续收到两个按键，造成错误读入，可以改进scanf接收字符串，
system("cls"); //以下所有getchar()、system("cls")同理
break;
}
case 2:
{
//信息查询
system("cls");
printf("欢迎进入信息查询版块!
");
printf("请输入要查询的学生编号：");
scanf("%d",&j);
getchar();
//printf("%d
",j); //检测输入是否成功,调试程序用
FindStu(head,j); //查询并输出
printf("
请输入回车键返回主菜单！");
getchar();
system("cls");
break;
}
case 3:
{
//成绩统计
system("cls");
printf("欢迎进入成绩统计版块!
");
printf("请输入科目：");
scanf("%s",&subname);
getchar();
printf("请输入分数范围(score1,score2)：");
scanf("%f,%f",&score1,&score2);
getchar();
/*printf("%s %5.2f %5.2f
",subname,
score1,score2); */ //检测输入是否成功，调试程序用
Count(head,subname,score1,score2); //统计并输出
printf("请输入回车键返回主菜单！");
getchar();
system("cls");
break;
}
case 4:
{
//成绩排序
system("cls");
printf("欢迎进入成绩排序版块，请输入科目：");
scanf("%s",&subname);
getchar();
Rank(head,subname); //排序并输出
printf("
请输入回车键返回主菜单！
");
getchar();
system("cls");
break;
}
case 5:
{
//保存退出
SaveQuit(head); //文件操作，保存并退出
free(head);
return 0;
}
default:
{
printf("输入有误，按回车键重新选择！
"); //主菜单错误输出检测
getchar();
system("cls");
}
}
}
}
//加载data数据 ，文件操作
pstu LoadInfo()
{
int num;
char name[20];
char sub1[20];
char sub2[20];
char sub3[20];
float score1;
float score2;
float score3;
char filename[] = "D:\\编程学习\\编程实践\\c语言课程设计1 学生信息管理\\data.txt"; //文件名,此处为简化编程，采用固定地址名称，未作输入
FILE *fp;
pstu head,ptr;
//创建带表头结点的空单链表head，用来存放载入信息
head = (pstu)malloc(SIZE);
ptr = head;
ptr->next = NULL;
//加载data文件，存入head链表
if( NULL == (fp = fopen(filename,"r")) ) //判断文件是否存在及可读
{
printf("error!");
exit(0);
}
while (!feof(fp))
{
fscanf(fp,"%d %s %s %f %s %f %s %f
",&num,&name,
&sub1,&score1,&sub2,&score2,&sub3,&score3); //读取一行，采用格式化读取，避免了其他各种读取方法的数据处理问题
//该方法缺点明显，对数据格式要求教研，故data文件规定数据格式
ptr->next = (pstu)malloc(SIZE);
ptr = ptr->next;
ptr->next = NULL;
ptr->num = num;
strcpy(ptr->name,name);
strcpy(ptr->subject[0].name,sub1);
ptr->subject[0].score = score1;
strcpy(ptr->subject[1].name,sub2);
ptr->subject[1].score = score2;
strcpy(ptr->subject[2].name,sub3);
ptr->subject[2].score = score3;
}
fclose(fp); //关闭文件,已得到保存data信息的链表head
return head;
}
//打印主菜单
void PrintMenu()
{
printf("***************************************
");
printf(" 枫枫学生信息管理系统
");
printf("***************************************
");
putchar('
');
printf("菜单
");
printf("\025 1、信息管理
");
printf("\025 2、信息查询
");
printf("\025 3、成绩统计
");
printf("\025 4、成绩排序
");
printf("\025 5、保存退出
");
}
//添加学生
pstu AddStu(pstu x)
{
char namestu[20];
char *p;
char subname1[20],subname2[20],subname3[20];
pstu head,ptr;
head = x;
ptr = head;
while( NULL != ptr->next ) //遍历链表，找到链尾结点
{
ptr = ptr->next;
}
ptr->next = (pstu)malloc(SIZE); //默认在链表末追加添加信息
ptr = ptr->next;
ptr->next = NULL;
printf("请输入添加学生的信息：
");
printf("请输入添加学生的学号：");
scanf("%d",&ptr->num);
getchar();
printf("请输入添加学生的姓名：");
scanf("%s",namestu);
getchar();
p = namestu;
strcpy(ptr->name,p);
printf("请输入添加学生的科目1名称：");
scanf("%s",&subname1);
getchar();
p = subname1;
strcpy(ptr->subject[0].name,p);
printf("请输入添加学生的科目1成绩：");
scanf("%f",&ptr->subject[0].score);
getchar();
printf("请输入添加学生的科目2名称：");
scanf("%s",&subname2);
getchar();
p = subname2;
strcpy(ptr->subject[1].name,p);
printf("请输入添加学生的科目2成绩：");
scanf("%f",&ptr->subject[1].score);
getchar();
printf("请输入添加学生的科目3名称：");
scanf("%s",&subname3);
getchar();
p = subname3;
strcpy(ptr->subject[2].name,p);
printf("请输入添加学生的科目3成绩：");
scanf("%f",&ptr->subject[2].score);
getchar();
putchar('
');
return head;
}
//删除学生
pstu DeleStu(pstu x)
{
int num;
pstu head,ptr,qtr;
head = x;
ptr = head->next;
qtr = head;
printf("请输入要删除的学生的学号：");
scanf("%d",&num);
getchar();
while(ptr!=NULL)
{
if( ptr->num != num) //遍历查找链表结点，未找到跳过该结点
{
ptr = ptr->next;
qtr = qtr->next;
}
else //找到则删除结点
{
ptr = ptr->next;
qtr->next = ptr;
break;
}
}
printf("该学生信息已删除！
");
return head;
}
//修改学生信息
pstu RwrStu(pstu x)
{
char namestu[20];
char *p;
char subname1[20],subname2[20],subname3[20];
int num;
pstu head,ptr;
head = x;
ptr = head->next;
printf("请输入要修改的学生的学号：");
scanf("%d",&num);
getchar();
while(ptr!=NULL)
{
if( ptr->num == num )
{
printf("已找到该学生信息，请填入修改项目：");
printf("请输入修改学生的姓名：");
scanf("%s",namestu);
getchar();
p = namestu;
strcpy(ptr->name,p);
printf("请输入修改学生的科目1名称：");
scanf("%s",subname1);
getchar();
p = subname1;
strcpy(ptr->subject[0].name,p);
printf("请输入修改学生的科目1成绩：");
scanf("%f",&ptr->subject[0].score);
getchar();
printf("请输入修改学生的科目2名称：");
scanf("%s",subname2);
getchar();
p = subname2;
strcpy(ptr->subject[1].name,p);
printf("请输入修改学生的科目2成绩：");
scanf("%f",&ptr->subject[1].score);
getchar();
printf("请输入修改学生的科目3名称：");
scanf("%s",subname3);
getchar();
p = subname3;
strcpy(ptr->subject[2].name,p);
printf("请输入修改学生的科目3成绩：");
scanf("%f",&ptr->subject[2].score);
getchar();
printf("该学生信息已修改！
");
break;
}
else
{
ptr = ptr->next;
}
}
return head;
}
//查找学生，参数为链表指针，和学生学号
//不好，应该将学号输入放进子函数，简化主函数结构，减少子函数参数
void FindStu(pstu x,char y)
{
pstu head,ptr;
head = x;
ptr = head->next;
while( ptr != NULL)
{
if( ptr->num == (int)y) //因主函数中为节省空间，学号输入采用char数据，故强行准换
{
printf("已找到该学生信息!
如下：");
printf("%03d %s %s %5.2f %s %5.2f %s %5.2f
",
ptr->num,ptr->name,ptr->subject[0].name,ptr->subject[0].score,ptr->subject[1].name,ptr->subject[1].score,ptr->subject[2].name,ptr->subject[2].score); break; //注意此处找到并输出信息后要手动退出循环
}
else
{
ptr = ptr->next;
}
}
if( ptr == NULL ) //查询成功检测，while循环中若找到，则ptr停留在当前学生的结点上
{
printf("未能找到该学生信息！
");
}
}
//统计科目分数区间段的学生,参数为链表指针，科目名称，分数区间上下限
//同理，参数的录入应放入子函数，简化结构和编程
void Count(pstu x,char *y,float q,float p)
{
pstu head,ptr;
char name[20];
char flag=0; //手动设置的查找结果flag
head = x;
ptr = head->next;
strcpy(name,y);
//printf("%s %5.2f %5.2f
",name,q,p); //检测输入参数的传递，调试程序用
while( ptr != NULL) //开始查找统计，科目查找用strcmp函数比较科目字符串,返回值0为字符串相等
{ //此处while循环体中，重复的查找步骤太多，应设置科目匹配flag，参照rank()函数
if( strcmp(name,ptr->subject[0].name) == 0 ) //通过flag将科目确认放在while之外，循环体内只做分数区间的扫描和输出
{
if( q <= ptr->subject[0].score && ptr->subject[0].score<= p )
{
printf("%03d %s %s %5.2f
",ptr->num,ptr->name,ptr->subject[0].name,ptr->subject[0].score);
flag++;
}
}
if( strcmp(name,ptr->subject[1].name) == 0 )
{
if( q <= ptr->subject[1].score && ptr->subject[1].score<= p )
{
printf("%03d %s %s %5.2f
",ptr->num,ptr->name,ptr->subject[1].name,ptr->subject[1].score);
flag++;
}
}
if( strcmp(name,ptr->subject[2].name) == 0 )
{
if( q <= ptr->subject[2].score && ptr->subject[2].score<= p )
{
printf("%03d %s %s %5.2f
",ptr->num,ptr->name,ptr->subject[2].name,ptr->subject[2].score);
flag++;
}
}
ptr = ptr->next;
}
if(flag==0)
{
printf("未能找到该课程该区间分数段的学生！
");
}
}
//学科成绩排名,采用交换数据的方法,参数为链表指针，科目名称
//同理参数问题
//链表排序问题，此处用交换结点数据方法，还有其他多种排序方法
//如，交换结点，辅助指针数组排序(未实现，过程繁杂)，插入法排序等
void Rank(pstu x,char *y)
{
pstu head,ptr,qtr;
char name[20];
char len=0;
char flag=0; //简化算法,设置科目查找结果判断值,flag=0表示科目输入为未知科目，不存在
int i=0; //i、j循环次数控制参数
int j=0;
char temp_name[20]; //数据交换时的暂存信息变量
float temp0,temp1,temp2;
int temp_num;
strcpy(name,y);
head = x;
ptr = head->next;
while( ptr != NULL) //测链表长度,不包括表头结点
{
ptr = ptr->next;
len++;
}
ptr = head->next; //指针ptr用过之后记得回原位
//开始查找科目
if( strcmp(name,ptr->subject[0].name) == 0) flag=1;
if( strcmp(name,ptr->subject[1].name) == 0) flag=2;
if( strcmp(name,ptr->subject[2].name) == 0) flag=3;
if( flag == 0)
{
printf("未找到该科目!");
return;
}
//开始排序,冒泡法比较各结点数据
//此处3个并列的if用switch case更清晰结构
if( n == 1 )
{
for( i=0;i<len;i++)
{
ptr = head->next->next; //每一次内循环之后，ptr、qtr必然在最后两个节点上
qtr = head->next; //故在进行内循环之前，要重新复位ptr、qtr
for( j=0;j<len-i-1;j++)
{
if( qtr->subject[0].score < ptr->subject[0].score )
{
temp_num = qtr->num; //交换数据,因数据格式(科目顺序)明确规定，故不再做科目名称的替换
strcpy(temp_name,qtr->name);
temp0 = qtr->subject[0].score;
temp1 = qtr->subject[1].score;
temp2 = qtr->subject[2].score;
qtr->num = ptr->num;
strcpy(qtr->name,ptr->name);
qtr->subject[0].score = ptr->subject[0].score;
qtr->subject[1].score = ptr->subject[1].score;
qtr->subject[2].score = ptr->subject[2].score;
ptr->num = temp_num;
strcpy(ptr->name,temp_name);
ptr->subject[0].score = temp0;
ptr->subject[1].score = temp1;
ptr->subject[2].score = temp2;
}
qtr = qtr->next;
ptr = ptr->next;
}
}
}
if( n == 2 )
{
for( i=0;i<len;i++)
{
ptr = head->next->next;
qtr = head->next;
for( j=0;j<len-i-1;j++)
{
if( qtr->subject[1].score < ptr->subject[1].score )
{
temp_num = qtr->num;
strcpy(temp_name,qtr->name);
temp0 = qtr->subject[0].score;
temp1 = qtr->subject[1].score;
temp2 = qtr->subject[2].score;
qtr->num = ptr->num;
strcpy(qtr->name,ptr->name);
qtr->subject[0].score = ptr->subject[0].score;
qtr->subject[1].score = ptr->subject[1].score;
qtr->subject[2].score = ptr->subject[2].score;
ptr->num = temp_num;
strcpy(ptr->name,temp_name);
ptr->subject[0].score = temp0;
ptr->subject[1].score = temp1;
ptr->subject[2].score = temp2;
}
qtr = qtr->next;
ptr = ptr->next;
}
}
}
if( n == 3 )
{
for( i=0;i<len;i++)
{
ptr = head->next->next;
qtr = head->next;
for( j=0;j<len-i-1;j++)
{
if( qtr->subject[2].score < ptr->subject[2].score )
{
temp_num = qtr->num;
strcpy(temp_name,qtr->name);
temp0 = qtr->subject[0].score;
temp1 = qtr->subject[1].score;
temp2 = qtr->subject[2].score;
qtr->num = ptr->num;
strcpy(qtr->name,ptr->name);
qtr->subject[0].score = ptr->subject[0].score;
qtr->subject[1].score = ptr->subject[1].score;
qtr->subject[2].score = ptr->subject[2].score;
ptr->num = temp_num;
strcpy(ptr->name,temp_name);
ptr->subject[0].score = temp0;
ptr->subject[1].score = temp1;
ptr->subject[2].score = temp2;
}
qtr = qtr->next;
ptr = ptr->next;
}
}
}
//输出排序过后的链表
ptr = head->next;
while( ptr != NULL )
{
printf("%03d %s %s %5.2f %s %5.2f %s %5.2f
",
ptr->num,ptr->name,ptr->subject[0].name,ptr->subject[0].score,
ptr->subject[1].name,ptr->subject[1].score,
ptr->subject[2].name,ptr->subject[2].score);
ptr = ptr->next;
}
}
//保存文件并退出，文件操作
void SaveQuit(pstu x)
{
pstu head,ptr;
FILE *fp;
char filename[] = "D:\\编程学习\\编程实践\\c语言课程设计1 学生信息管理\\data.txt";
head = x;
ptr = head->next;
if( NULL == (fp = fopen(filename,"w")) ) //判断文件是否存在及可读
{
printf("error!");
exit(0);
}
while(ptr != NULL) //遍历链表结点，按data约定格式输出数据
{
fprintf(fp,"%03d %s %s %5.2f %s %5.2f %s %5.2f",
ptr->num,ptr->name,ptr->subject[0].name,ptr->subject[0].score,
绛旓細瀛︾敓瀛︾睄绠＄悊绯荤粺,閲囩敤鏁版嵁鏂囦欢瀛樻斁瀛︾敓鐨勫绫,鍙瀛︾敓瀛︾睄杩涜鐧诲綍.淇敼.鍒犻櫎.鏌ユ壘.缁熻.杈撳嚭绛夋搷浣溿傜櫥褰曞鐢熺殑瀛﹀彿.濮撳悕.鎬у埆.骞撮緞. 绫嶈疮.绯诲埆.涓撲笟.鐝骇;淇敼宸茬煡瀛﹀彿鐨勫鐢熶俊鎭;鍒犻櫎宸茬煡瀛﹀彿鐨勫鐢熶俊鎭;鏌ユ壘宸茬煡瀛﹀彿鐨勫鐢熶俊鎭;鎸夊鍙疯緭鍑哄鐢熺睄璐〃銆璁捐涓涓鍚嶄负status.c鐨勭▼搴,璇ョ▼搴忎腑鐨勪富鍑芥暟鏄剧ず绯荤粺鑿滃崟...
绛旓細"瀛︾敓瀛︾睄绠＄悊"鐨C绋嬪簭 include<stdlib.h> include<stdio.h> include<malloc.h> struct list{ int num;char name[256];int china;int english;int math;struct list *next;};typedef struct list node;typedef node *link;void printf_list(link head){ link pointer;pointer=head;while(pointer!
绛旓細{ 1 case '1': read(); //璋冪敤寤虹珛閾捐〃鐨勫嚱鏁帮紱杈撳嚭閾捐〃淇℃伅锛沺rint();printf("\nPress any key Continue ");//getchar();getchar();break;case '2': //璋冪敤鎸夊鍙锋煡鎵瀛︾敓淇℃伅鐨勫嚱鏁帮紱骞惰緭鍑烘煡鎵剧粨鏋滀俊鎭紱long c;printf("input the number you want to find:");scanf("%ld",&c);...
绛旓細1.2 鑳屾櫙鍙婅寖鍥 鏈」鐩殑鍚嶇О锛瀛︾睄绠＄悊绯荤粺寮鍙戣蒋浠躲傛湰椤圭洰鐨勪换鍔℃彁鍑鸿呭強寮鍙戣呮槸瀛︾睄绠＄悊绯荤粺杞欢寮鍙戝皬缁,鐢ㄦ埛鏄暀瀛﹀姙鍏銆傛湰浜у搧鑳藉叿浣撳寲銆佸悎鐞嗗寲鐨绠＄悊瀛︾敓鐨勫绫嶆。妗堬紝鐢ㄧ粨鏋勫寲鐨勬濈淮鏂瑰紡鍘讳簡瑙ｈ绠楁満鐨勫熀鏈伐浣滃師鐞嗗拰姹夎绋嬪簭璁捐璇█銆1.3 瀹氫箟 缂╁啓璇 鐣ヨ 姹夎绋嬪簭璁捐璇█锛氬畠鏄敱鍖椾含鍏...
绛旓細<<" 骞冲潎鍒:"<<g[1]/n<<" 鍙婃牸鐜:"<<j[1]/n<<endl<<"\t\t\b\b\b\b璁＄畻鏈烘诲垎: "<<g[2]<<" 骞冲潎鍒: "<<g[2]/n<<" 鍙婃牸鐜:"<<j[2]/n<<endl;}//涓婚夎彍鍗曞嚱鏁癱har school::mainmenu(){char n[6];cout<<"\n\n 鈽嗏槅鈽嗘杩庤繘鍏ラ珮鏍瀛︾睄绠＄悊绯荤粺鈽嗏槅鈽"<<endl<<endl<<" ...
绛旓細int math;int total;}stud[100];struct node temp;void menu();int input();void find(int);void insert(int);void deletel(int);void print(int);void sort(int);void main(){int n,c=0,d=0;while(1){menu();scanf("%d",&n);switch(n){case 1:system("cls");d=input()...
绛旓細printf("璇疯緭鍏瀛︾敓涓暟锛");scanf("%d",&n);printf("璇疯緭鍏ヤ俊鎭拰鎴愮哗\n");printf("濮撳悕锛屽鍙凤紝鑻辫锛岄珮鏁帮紝C璇█锛屼綋鑲:");printf("\n");stu p,q;p=q=(stu)malloc(sizeof(student));head=p;for(i=0;i<n;i++){ p->next=q;p=q;scanf("%s%d%d%d",q->name,&q->num,...
绛旓細char c;printf("\n\n");printf(" | 1. 澧炲姞瀛︾敓璁板綍 5.缁熻淇℃伅 |\n");printf(" | 2. 鏌ヨ瀛︾敓璁板綍 6.鎵撳紑鏂囦欢 |\n");printf(" | 3. 淇敼瀛︾敓璁板綍 7.淇濆瓨鏂囦欢 |\n");printf(" | 4. 瀛︾敓绾綍鎺掑簭 8.鏄剧ず璁板綍 |\n");printf(" | 0.閫鍑绯荤粺 |\n");printf("\n\n");pr...
绛旓細瀛︾敓瀛︾睄绠＄悊绯荤粺,鑳芥彁渚涗互涓嬪姛鑳:1)褰曞叆瀛︾敓瀛︾睄淇℃伅骞朵繚瀛2)鏌ヨ瀛︾敓瀛︾睄淇℃伅3)淇敼瀛︾敓瀛︾睄淇℃伅骞朵繚瀛4)鍒犻櫎瀛︾敓瀛︾睄淇℃伅5)杈撳嚭瀛︾敓瀛︾睄淇℃伅閭ｄ綅楂樻墜鑳界粰鎸囩偣涓柟鍚戝氨琛岃鏄兘缁... 瀛︾敓瀛︾睄绠＄悊绯荤粺,鑳芥彁渚涗互涓嬪姛鑳:1) 褰曞叆瀛︾敓瀛︾睄淇℃伅骞朵繚瀛2) 鏌ヨ瀛︾敓瀛︾睄淇℃伅3) 淇敼瀛︾敓瀛︾睄淇℃伅骞朵繚瀛4) 鍒犻櫎瀛︾敓瀛︾睄淇℃伅...
绛旓細typedef struct Student{ int shuxue;int yuwen;int yingyu;int huaxue;int wuli;}Stu;Stu student[5] = { {98, 43, 54, 65, 54},{65, 54, 35, 76, 97},{77, 87, 45, 76, 45},{54, 87, 23, 65, 87},{76, 98, 67, 98, 76} };int i, maxshuxue = 0, maxyuwen = ...
