以下将展示2022-2023寒假学习成果

崔浩杰

杜浩南

杜浩南的代码，点开阅读

#include #include #include typedef struct Stu { int ID;//编号 char name[25];//姓名 char Gander[4];//性别 char age[25];//出生年月日 char ClassName[10];//班级名称//对比的一句 float GS;//高等数学 float DY;//大学英语 float JC;//计算机基础 float LL;//理论 float TY;//体育 } Stu; typedef struct Node { Stu Data; struct Node *pnext; } Node; void Save(Node *head) { Node *find = head->pnext; FILE *fp = fopen("Data.txt", "w"); while (find) { fprintf(fp, "%d %s %s %s %s %.2f %.2f %.2f %.2f %.2f\n", find->Data.ID, find->Data.name, find->Data.Gander, find->Data.age, find->Data.ClassName, find->Data.GS, find->Data.DY, find->Data.JC, find->Data.LL, find->Data.TY); find = find->pnext; } fclose(fp); } void load(Node *head) { Node *find = head; Node *pnew; FILE *fp = fopen("Data.txt", "r"); if (fp == NULL) return; else { char ch = fgetc(fp); if (ch == EOF) { fclose(fp); return; } else { fclose(fp); fp = fopen("Data.txt", "r"); while (!feof(fp)) { pnew = (Node*)malloc(sizeof(Node)); fscanf(fp, "%d %s %s %s %s %f %f %f %f %f\n", &pnew->Data.ID, pnew->Data.name, pnew->Data.Gander, pnew->Data.age, pnew->Data.ClassName, &pnew->Data.GS, &pnew->Data.DY, &pnew->Data.JC, &pnew->Data.LL, &pnew->Data.TY); find->pnext = pnew; pnew->pnext = NULL; find = pnew;

        }
        fclose(fp);
    }
}

}
int bijiao(char *str, char *str1)
{
int i, j;
int n = 0;
for (i = 0; i < strlen(str1); i += 2)
{
for (j = 0; j < strlen(str); j += 2)
{
if (str1[i] == str[j] && str1[i + 1] == str[j + 1])
n++;
}
}
if (n == strlen(str) / 2) //除以二的原因是一个汉字占两个字节，但n计数原理是
return 1; //当相邻的两个字节都相等时，才自增一
else
return 0;
}
void DelAll(Node **head)
{
Node *Del = (*head)->pnext;
while (Del != NULL)
{
(*head)->pnext = Del->pnext;
free(Del);
Del = (*head)->pnext;

}
free((*head));
(*head) = NULL;

}
void ShowOne(Node *pnew)
{
printf(“%d\t%s\t%s\t%s\t%s\t%4.2f\t%4.2f %4.2f %4.2f %4.2f\n”,
pnew->Data.ID, pnew->Data.name, pnew->Data.Gander, pnew->Data.age, pnew->Data.ClassName,
pnew->Data.GS, pnew->Data.DY, pnew->Data.JC, pnew->Data.LL, pnew->Data.TY);
}
void inputData(Node *pnew)
{
printf(“输入学号: “);
scanf(“%d”, &pnew->Data.ID);
printf(“输入姓名: “);
scanf(“%s”, pnew->Data.name);
printf(“输入性别: “);
scanf(“%s”, pnew->Data.Gander);
printf(“输入生日: “);
scanf(“%s”, pnew->Data.age);
printf(“输入班级名称: “);
scanf(“%s”, pnew->Data.ClassName);
printf(“输入高等数学: “);
scanf(“%f”, &pnew->Data.GS);
printf(“输入大学英语: “);
scanf(“%f”, &pnew->Data.DY);
printf(“输入计算机基础: “);
scanf(“%f”, &pnew->Data.JC);
printf(“输入大学理论: “);
scanf(“%f”, &pnew->Data.LL);
printf(“输入体育成绩: “);
scanf(“%f”, &pnew->Data.TY);

}
void CreateEmpty(Node *head)
{
(head) = (Node)malloc(sizeof(Node));
(*head)->pnext=NULL;
}
void InsertNode(Node *head)
{
Node *Insert = head;
while (Insert ->pnext)
{
Insert = Insert->pnext;
}
Node *pnew = (Node)malloc(sizeof(Node));
pnew->pnext = NULL;
inputData(pnew);
Insert->pnext = pnew;
system(“pause”);
system(“cls”);
Save(head);

}
Node *findNode(Node *head,int flage)
{
if (flage == 0)
{
int n;
Node *find = head->pnext;
Node *fe = head;
printf(“请输入学生的学号: “);
scanf(“%d”, &n);
while (find)
{
if (n == find->Data.ID)
{
return fe;//前驱返回来
}
find = find->pnext;
fe = fe->pnext;
}
return NULL;
}
if (flage == 1)
{
int n;
Node *find = head->pnext;
printf(“请输入学生的学号: “);
scanf(“%d”, &n);
while (find)
{
if (n==find->Data.ID)
{
return find;
}
find = find->pnext;
}
return NULL;
}
if (flage == 2)
{
char n[25];
Node *find = head->pnext;
printf(“请输入学生的姓名: “);
scanf(“%s”, n);
while (find)
{
if (strcmp(n,find->Data.name)==0);
{
return find;
}
find = find->pnext;
}
return NULL;
}
if (flage == 3)
{
char n[25];
Node *find = head->pnext;
printf(“请输入学生的姓氏: “);
scanf(“%s”, n);
while (find)
{
if(bijiao(n,find->Data.name)==1)
{
ShowOne(find);
}
find = find->pnext;
}
return NULL;
}

}
void ReNode(Node *head)
{
Node *St = findNode(head,1);
if (St == NULL)
{
printf(“没有找到此学生\n”);
system(“pause”);
system(“cls”);
return;
}
else
{
inputData(St);
system(“pause”);
system(“cls”);
Save(head);

}

}
void DelNode(Node *head)
{
Node *find = findNode(head,0);
if (find == NULL)
{
printf(“没有找到这个这个学生\n”);
system(“pause”);
system(“cls”);
return;
}
else
{
Node *Del = find->pnext;
find->pnext = find->pnext->pnext;
free(Del);
printf(“删除成功\n”);
system(“pause”);
system(“cls”);
Save(head);
return;
}
}
void TJNode(Node *head)//0代表平均分，1-5代表其余的分
{
int i, count = 0, num;//count记录链表结点的个数，num进行内层循环，
Node *p, *q, *tail;//创建三个指针，进行冒泡排序
p = head;
while (p->pnext != NULL)//计算出结点的个数
{
count++;//注释①
p = p->pnext;
}
for (i = 0; i < count - 1; i++)//外层循环，跟数组冒泡排序一样
{
num = count - i - 1;//记录内层循环需要的次数，跟数组冒泡排序一样，
q = head->pnext;//令q指向第一个结点
p = q->pnext;//令p指向后一个结点
tail = head;//让tail始终指向q前一个结点，方便交换，也方便与进行下一步操作
while (num–)//内层循环 次数跟数组冒泡排序一样
{
if ((q->Data.DY+ q->Data.GS+ q->Data.JC+ q->Data.LL+ q->Data.TY)/5<
(p->Data.DY + p->Data.GS + p->Data.JC + p->Data.LL + p->Data.TY) / 5)//如果该结点的值大于后一个结点，则交换
{
q->pnext = p->pnext;
p->pnext = q;
tail->pnext = p;
}
tail = tail->pnext;//注释②
q = tail->pnext;//注释②
p = q->pnext;//注释②
}
}
//开始统计
int j = 1;
char Buff[20];
Node *pShow = head->pnext;
Node *PCur = head;
while (pShow)
{

    if (pShow==head->pnext&&PCur==head)//第一个元素
    {
        sprintf(Buff, "第%d名", j, 20);
        printf("%s\t%d\t%s\t%.2f\n", Buff, pShow->Data.ID, pShow->Data.name,
               (pShow->Data.DY + pShow->Data.GS + pShow->Data.JC + pShow->Data.LL + pShow->Data.TY) / 5);
    }
    if ((PCur->Data.DY + PCur->Data.GS + PCur->Data.JC + PCur->Data.LL + PCur->Data.TY) / 5==
            (pShow->Data.DY + pShow->Data.GS + pShow->Data.JC + pShow->Data.LL + pShow->Data.TY) / 5)//并列
    {

        sprintf(Buff, "第%d名", j, 20);
        printf("%s\t%d\t%s\t%.2f\n", Buff, pShow->Data.ID, pShow->Data.name,
               (pShow->Data.DY + pShow->Data.GS + pShow->Data.JC + pShow->Data.LL + pShow->Data.TY) / 5);

    }
    if((PCur->Data.DY + PCur->Data.GS + PCur->Data.JC + PCur->Data.LL + PCur->Data.TY) / 5 >
            (pShow->Data.DY + pShow->Data.GS + pShow->Data.JC + pShow->Data.LL + pShow->Data.TY) / 5)
    {
        j++;
        sprintf(Buff, "第%d名", j, 20);
        printf("%s\t%d\t%s\t%.2f\n", Buff, pShow->Data.ID, pShow->Data.name,
               (pShow->Data.DY + pShow->Data.GS + pShow->Data.JC + pShow->Data.LL + pShow->Data.TY) / 5);

    }
    pShow = pShow->pnext;
    PCur = PCur->pnext;
}
system("pause");
system("cls");

}
void FJPJ(Node *head)
{
float total = 0;
int a, b, c, d, e;
a = b = c = d = e = 0;
Node *p = head->pnext;
while (p)
{
total = (p->Data.DY + p->Data.GS + p->Data.JC + p->Data.LL + p->Data.TY) / 5;
if (total<60)
{
a++;
}
if (total>=60&&total<70)
{
b++;
}
if (total>=70&&total<80)
{
c++;
}
if (total>=80&&total<90)
{
d++;
}
if (total>=90)
{
e++;
}
p = p->pnext;
}
printf(“60分以下: %d人\n”,a);
printf(“60-70分: %d人\n”, b);
printf(“70-80分: %d人\n”, c);
printf(“80-90分: %d人\n”, d);
printf(“90-100分: %d人\n”, e);
system(“pause”);
system(“cls”);

}
Node Rehead(Node *head,char * number)
{
Node *pnew;
Node *find = head->pnext;
Node *temp;
Node *in;
CreateEmpty(&temp);//分配新头结点
in = temp;
while (find)
{
if (strcmp(number,find->Data.ClassName)==0)
{
pnew = (Node)malloc(sizeof(Node));
pnew->Data = find->Data;
pnew->pnext = NULL;
in->pnext = pnew;
in = pnew;
}
find = find->pnext;
}
return temp;
}
Node ReGander(Node *head, char *ch)
{
Node *pnew;
Node *find = head->pnext;
Node *temp;
Node *in;
CreateEmpty(&temp);//分配新头结点
in = temp;
while (find)
{
if (strcmp(ch,find->Data.Gander)==0)
{
pnew = (Node)malloc(sizeof(Node));
pnew->Data = find->Data;
pnew->pnext = NULL;
in->pnext = pnew;
in = pnew;
}
find = find->pnext;
}
return temp;
}
void BJ(Node *head)
{
char str[25];
printf(“请输入要查询的班级: “);
scanf(“%s”,str);
Node *ClassOne = Rehead(head, str);
TJNode(ClassOne);
DelAll(&ClassOne);
system(“pause”);
system(“cls”);

}
void Gander(Node *head)
{
char gander[8];
printf(“请输入要统计的性别:男 女 “);
scanf(“%s”,gander);
Node *ClassOne=ReGander(head,gander);
TJNode(ClassOne);
DelAll(&ClassOne);
system(“pause”);
system(“cls”);
}
void ClassName(Node *head)
{
char gander[10];
printf(“请输入要统计的班级名称:”);
scanf(“%s”, gander);
Node *ClassOne = Rehead(head, gander);
TJNode(ClassOne);
DelAll(&ClassOne);
system(“pause”);
system(“cls”);
}
void TJBJG(Node *head)
{
Node *find = head->pnext;
while (find)
{
if (find->Data.DY < 60)
{
printf(“姓名:%s 课程:大学英语 %.2f\n”, find->Data.name, find->Data.DY);
}
if (find->Data.GS < 60)
{
printf(“姓名:%s 课程:高等数学 %.2f\n”, find->Data.name, find->Data.GS);

    }
    if (find->Data.JC < 60)
    {
        printf("姓名:%s 课程:计算机基础 %.2f\n", find->Data.name, find->Data.JC);

    }
    if (find->Data.LL < 60)
    {
        printf("姓名:%s 课程:理论 %.2f\n", find->Data.name, find->Data.LL);

    }
    if (find->Data.TY < 60)
    {
        printf("姓名:%s 课程:体育 %.2f\n", find->Data.name, find->Data.LL);

    }
    find = find->pnext;
}

}
int main()
{
int n;
Node *head;
CreateEmpty(&head);
load(head);
while (1)
{
printf(“1.添加学生信息\n”);
printf(“2.删除学生信息\n”);
printf(“3.修改学生信息\n”);
printf(“4.统计班级排名\n”);
printf(“5.分数段统计\n”);
printf(“6.统计性别排名\n”);
printf(“7.学生统计排名\n”);
printf(“8.按学号查询\n”);
printf(“9.按姓名查询\n”);
printf(“10.按姓氏查询\n”);
printf(“11.按科目统计不及格\n”);
scanf(“%d”, &n);
switch (n)
{
case 1:
InsertNode(head);
break;
case 2:
DelNode(head);
break;
case 3:
ReNode(head);
break;
case 4:
ClassName(head);
break;
case 5:
FJPJ(head);
break;
case 6:
Gander(head);
break;
case 7:
TJNode(head);
break;
case 8:
{
ShowOne(findNode(head, 1));
}
break;
case 9:
{

        ShowOne(findNode(head, 2));
    }
    break;
    case 10:
    {
        findNode(head, 3);
    }
    break;
    case 11:
    {
        TJBJG(head);
    }
    break;
    default:
        break;
    }
}

}

高博栋

(点击上面空白部分阅读pdf)

贾新璐

李昊轩

李可期

算法学习

李思源

(点击上面空白部分阅读pdf)

刘博

刘硕

彭勇

(点击上面空白部分阅读pdf)

宋向南

田丰淇

王博

王博的代码，点击查看

#include #include #include #define LEN sizeof(struct record) /*对结构体长度进行宏定义*/ void menu();/*声明菜单函数*/ struct record*insert(struct record *head);/*声明添加函数 */ struct record*delet(struct record *head); /*声明删除函数 */ struct record*alter(struct record *head); /*声明修改函数 */ void search(struct record *head); /*声明查找函数*/ void show(struct record *head); /*声明显示函数*/ struct record *head; /*定义全局结构体指针变量*/ int n=0; /*定义全局变量*/ struct record /*声明结构体*/ { char number[10]; char name[20]; char phone[20]; char adress[40]; char postcode[10]; char e_mail[30]; struct record *next; }; /****************************************************************************** * * * 主函数 * * * *******************************************************************************/ main() { head=NULL; menu(); rewind(stdin); } /****************************************************************************** * * * 菜单函数 * * * *******************************************************************************/ void menu() { int choice; printf("\n\t\t******************** 电话簿 ********************"); printf("\n\t\t*********** 1-添加纪录 2-查询纪录 ************"); printf("\n\t\t*********** 3-删除纪录 4-修改记录 ************"); printf("\n\t\t*********** 5-显示纪录 6-退出系统 ************"); printf("\n\t\t************************************************"); printf("\n\t\t请选择："); scanf("%d",&choice); rewind(stdin); printf("\n"); switch (choice) { case 1: head=insert(head); rewind(stdin); menu(); break; case 2: search(head); rewind(stdin); menu(); break; case 3: head=delet(head); rewind(stdin); menu(); break; case 4: head=alter(head); rewind(stdin); menu(); break; case 5: show(head); rewind(stdin); menu(); break; default: printf("\n\t\t谢谢使用!!"); break; } } /****************************************************************************** * * * 添加函数 * * * *******************************************************************************/ struct record *insert(struct record *head) { struct record *pp,*p1,*p2; pp=(struct record *)malloc(LEN); printf("\n\t\t**************** 请输入用户信息 ****************\n"); printf("\n\t\t输入序号:"); scanf("%s",pp->number); rewind(stdin); printf("\n\t\t输入姓名:"); scanf("%s",pp->name); rewind(stdin); printf("\n\t\t输入电话号码:"); scanf("%s",pp->phone); rewind(stdin); printf("\n\t\t输入地址:"); scanf("%s",pp->adress); rewind(stdin); printf("\n\t\t输入邮编:"); scanf("%s",pp->postcode); rewind(stdin); printf("\n\t\t输入e-mail:"); scanf("%s",pp->e_mail); rewind(stdin); if(head==NULL)/*在表头插入1*/ { head=pp; pp->next=NULL; } else { p1=head; while((strcmp(pp->number,p1->number)>0)&&(p1->next!=NULL)) { p2=p1; p1=p1->next; } if(strcmp(pp->number,p1->number)<=0) { if(head==p1) head=pp; /*在表头插入2*/ else p2->next=pp;/*在表中插入*/ pp->next=p1; } else /*在表尾插入*/ { p1->next=pp; pp->next=NULL; } } printf("\t添加成功!请继续选择功能键!\n\n"); n=n+1; return(head); } /****************************************************************************** * * * 删除函数 * * * *******************************************************************************/ struct record*delet(struct record * head) { struct record *p1,*p2; char number[10]; printf("\t请输入要删除用户的序号number:"); scanf("%s",&number); rewind(stdin); if(head==NULL) { printf("\n\t通讯录无用户信息记录!!\n"); return(head); } p1=head; while(strcmp(number,p1->number)!=0&&p1->next!=NULL) { p2=p1; p1=p1->next; } if(strcmp(number,p1->number)==0) { if(p1==head) { head=p1->next; printf("\t删除成功!请继续选择功能键!\n\n"); } else { p2=p1->next; printf("\t已删 除的用户的序号为:%s\n",number); printf("\t删除成功!请继续选择功能键!\n\n"); } n=n-1; } else printf("\t通讯录无该用户的信息记录!\n "); return(head); } /****************************************************************************** * * * 查询函数 * * * *******************************************************************************/ void search(struct record *head) { int a; char f_name[20],f_number[10]; struct record *p1,*p2; if(head==NULL) { printf("\t通讯录无用户信息记录\n"); return; } else { printf("\t请你选择你查找的方式:\n\n\t\t1:序号\n\t\t2:姓名\n"); printf("\t\t请选择:"); scanf("%d",&a); rewind(stdin); switch(a) { case 1: printf("\n\t请输入要查找用户的序号number:"); scanf("%s",&f_number); rewind(stdin); p1=head; while(strcmp(p1->number,f_number)!=0) { if(p1->next==NULL) { printf("\n\t通讯录无此用户信息记录\n"); return; } else { p2=p1->next; p1=p2; } } printf("\n\t要查找用户的基本信息为:\n"); printf("\t\t序号: %s\n\t\t姓名:%s\n\t\t电话号码:%s",p1->number,p1->name,p1->phone); printf("\n\t\t地址:%s\n\t\t邮编:%s\n\t\te_mail:%s\n",p1->adress,p1->postcode,p1->e_mail); break; case 2: printf("\n\t请输入要查找用户的姓名name:"); scanf("%s",f_name); rewind(stdin); p1=head; while(strcmp(p1->name,f_name)!=0) { if(p1->next==NULL) { printf("\n\t通讯录无此用户信息记录\n"); return; } else { p2=p1->next; p1=p2; } } printf("\n\t要查找用户的基本信息为:\n"); printf("\t\t序号: %s\n\t\t姓名:%s\n\t\t电话号码:%s",p1->number,p1->name,p1->phone); printf("\n\t\t地址:%s\n\t\t邮编:%s\n\t\te_mail:%s",p1->adress,p1->postcode,p1->e_mail); break; } } } /****************************************************************************** * * * 显示函数 * * * *******************************************************************************/ void show(struct record *head) { int i; struct record *p1,*p2; p1=head; if(head==NULL) { printf("\t通讯录无用户信息记录\n"); return; } else { for(i=1; i<=n; i++) { printf("\n\t第%d个用户的基本信息为:",i); printf("\n\t\t序号: %s 姓名:%s 电话号码:%s \n\t\t地址:%s 邮编:%s e_mail:%s\n" ,p1->number,p1->name,p1->phone,p1->adress,p1->postcode,p1->e_mail); p2=p1->next; p1=p2; } } } /****************************************************************************** * * * 修改函数 * * * *******************************************************************************/ struct record*alter(struct record*head) { struct record *p1,*p2; int choice1; char alter_number[10],alter_name[20],alter_phone[20],alter_adress[40],alter_postcode[10],alter_e_mail[30],choice2; p1=head; if(head==NULL) { printf("通讯录无用户信息记录\n"); return(head); } printf("\t请输入要修改的用户的序号number:"); scanf("%s",alter_number); rewind(stdin); while(strcmp(p1->number,alter_number)!=0) { if(p1->next==NULL) { printf("\n\t通讯录无此用户信息记录\n"); return(head); } else { p2=p1; p1=p1->next; } } if(strcmp(p1->number,alter_number)!=0) { printf("通讯录无用户信息记录\n"); return(head); } else { printf("\t要修改的用户的基本信息为:\n\t"); printf("\t序号: %s 姓名:%s 电话号码:%s 地址:%s 邮编:%s e_mail:%s\n" ,p1->number,p1->name,p1->phone,p1->adress,p1->postcode,p1->e_mail); } while(1) { printf("\t你是否要修改的用户的基本信息?(y&n)"); scanf("%c",&choice2); rewind(stdin); if(choice2=='y') { printf("\t请选择你要修改的项目:\n\t"); printf("1:姓名 2:电话号码 3:地址 4:邮编 5:e_mail\n"); printf("\t你选择的序号为: "); scanf("%d",&choice1); rewind(stdin); switch(choice1) { case 1: printf("\t请输入更改后的姓名"); scanf("%s",alter_name); rewind(stdin); strcpy(p1->name,alter_name); continue; case 2: printf("\t请输入更改后的电话号码"); scanf("%s",alter_phone); rewind(stdin); strcpy(p1->phone,alter_phone); continue; case 3: printf("\t请输入更改后的地址"); scanf("%s",alter_adress); rewind(stdin); strcpy(p1->adress,alter_adress); continue; case 4: printf("\t请输入更改后的邮编"); scanf("%s",&alter_postcode); rewind(stdin); strcpy(p1->postcode,alter_postcode); continue; case 5: printf("\t请输入更改后的e_mail"); scanf("%s",alter_e_mail); rewind(stdin); strcpy(p1->e_mail,alter_e_mail); continue; } printf("\n\t修改后用户的基本信息为:\n\t"); printf("\t序号: %s 姓名:%s 电话号码:%s 地址:%s 邮编:%s e_mail\n" ,p1->number,p1->name,p1->phone,p1->adress,p1->postcode,p1->e_mail); } else { printf("\n\t修改成功!!\n"); break; } } return(head); }

吴开燕

(点击上面空白部分阅读pdf)

向城志

闫佳乐

歼20大战赛博顶针

杨帅

袁欢

(点击上面空白部分阅读pdf)

张菁

周璟轩

斗地主雏形