学生成绩学号管理系统v1.0
发布日期:2021-06-30 22:22:04 浏览次数:2 分类:技术文章

本文共 4403 字,大约阅读时间需要 14 分钟。

Mooc课后习题集 及 做到的一些有趣的题

这是我初学c开始有意识的记录自己做的每一道题开始写下的代码水平 一个一个代码发出来 直到我现在学的数据结构 那个时候还不会注释 格式什么的也是按照自己怎么喜欢怎么来 如果真不会看会代码理解一下 qwq 如代码有错请见谅 毕竟都好久以前敲得了hhh ~~

如果对各位的思路引导有帮助那更好

#include 
#include
#define len 30void Input_record(int number,int name[len],int score[len]);void TotalandaverageScoreofCourse(int number,int score[len]);void OrderName(int number,int name[len]);void OrderScore(int number,int score[len]);void SearchScore(int number,int name[len],int score[len]);void Analyis(int number,int score[len]);void Listrecord(int number,int name[len],int score[len]);int main(){
int option,number; printf("Input student number(n<30):\n"); scanf("%d",&number); int score[len]={
0}; int name[len]={
0}; do{
printf("Management for Students' scores\n\n1.Input record\n\n2.Caculate total and average score of course\n\n3.Sort in descending order by score\n\n4.Sort in ascending order by number\n\n5.Search by number\n\n6.Statistic analysis\n\n7.List record\n\n0.Exit\n\nPlease Input your choice:"); scanf("%d",&option); switch(option) {
case 1:Input_record(number,name,score);break; case 2:TotalandaverageScoreofCourse(number,score);break; case 3:OrderScore(number,score);break; case 4:OrderName(number,name);break; case 5:SearchScore(number,name,score);break; case 6:Analyis(number,score);break; case 7:Listrecord(number,name,score);break; case 0:break; default:printf("false number plz input again!\n");break; } }while(option!=0); printf("You choose to exit\nThanks for using this code\n:)"); return 0;}void Input_record(int number,int name[len],int score[len]){
int i; printf("Input student's ID, name and score:\n"); for(i=0;i<=number-1;i++) {
scanf("%d%*c%d",&name[i],&score[i]); } printf("\n\n\n");}void TotalandaverageScoreofCourse(int number,int score[len]){
float sum=0; int i; for(i=0;i<=number-1;i++) {
sum=sum+score[i]; } printf("sum=%.0f,aver=%.2f\n",sum,sum/number); printf("\n\n\n");}void OrderName(int number,int name[len]){
int i,j,temp=name[0],copy[len]={
0}; memcpy(copy,name,sizeof(int)*number); for(i=0;i<=number-2;i++) {
for(j=i+1;j<=number-1;j++) {
if(copy[i]>copy[j]) {
temp=copy[i]; copy[i]=copy[j]; copy[j]=temp; } } } for(i=0;i<=number-1;i++) {
printf("%d\n",copy[i]); } printf("\n\n\n");}void OrderScore(int number,int score[len]){
int i,j,temp=0,copy[len]={
0}; memcpy(copy,score,sizeof(int)*number); for(i=0;i<=number-2;i++) {
for(j=i+1;j<=number-1;j++) {
if(copy[i]>copy[j]) {
temp=copy[i]; copy[i]=copy[j]; copy[j]=temp; } } } for(i=0;i<=number-1;i++) {
printf("%d\n",copy[i]); } printf("\n\n\n");}void SearchScore(int number,int name[len],int score[len]){
int i,inputname; scanf("%d",&inputname); for(i=0;i<=number-1;i++) {
if(name[i]==inputname) {
printf("%d %d",name[i],score[i]); printf("\n\n\n"); break; } } if(i==number && name[i-1]!=inputname) {
printf("No found!"); printf("\n\n\n"); }}void Analyis(int number,int score[len]){
int i,lv1=0,lv2=0,lv3=0,lv4=0,lv5=0,lvgod=0; for(i=0;i<=number-1;i++) {
if(score[i]>100 ||score[i]<0) lvgod++; else if(score[i]<=100 && score[i]>=90) lv1++; else if(score[i]<90 && score[i]>=80) lv2++; else if(score[i]<80 && score[i]>=70) lv3++; else if(score[i]<70 && score[i]>=60) lv4++; else lv5++; } printf("lv1 (90~100) : %d\n",lv1); printf("lv2 (80~90) : %d\n",lv2); printf("lv3 (70~80) : %d\n",lv3); printf("lv4 (60~70) : %d\n",lv4); printf("lv5 (0~60) : %d\n",lv5); printf("lv6 (god score) : %d\n",lvgod); printf("\n\n\n");}void Listrecord(int number,int name[len],int score[len]){
int i; for(i=0;i<=number-1;i++) {
printf("%d %d\n",name[i],score[i]); } printf("\n\n\n");}

转载地址:https://love6.blog.csdn.net/article/details/110236737 如侵犯您的版权,请留言回复原文章的地址,我们会给您删除此文章,给您带来不便请您谅解!

上一篇:找最值(哈工大Mooc)
下一篇:有趣的“回文”检测(哈工大Mooc)

发表评论

最新留言

第一次来,支持一个
[***.219.124.196]2024年04月22日 23时25分21秒