ICode9

精准搜索请尝试: 精确搜索
首页 > 其他分享> 文章详细

大奖赛现场统分(哈工大Mooc)

2020-11-29 09:02:01  阅读:220  来源: 互联网

标签:Mooc finalscore score sum len 哈工大 sum1 printf 统分


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

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

#include <stdio.h>
#include <math.h>
#define len 10

int main()
{
    int i,j;
    int playerName[len]={0},judgeName[len];
    float finalscore[len]={0},score[len][len],judgescore[len][len],sum1[len];
    float max,min,sum=0;
    int playersNumber,judgesNumber;
    int tempName;
    float tempScore;
    printf("How many Athletes\n");
    scanf("%d",&playersNumber);
    printf("How many judges?\n");
    scanf("%d",&judgesNumber);
    printf("Scores of Athletes:\n");
    for(i=0;i<=playersNumber-1;i++)
    {
        printf("Athlete %d is playing.\n",i+1);
        printf("Please enter his number code:\n");
        scanf("%d",&playerName[i]);
        max=score[i][0];
        min=10;
        sum=0;
        for(j=0;j<=judgesNumber-1;j++)
        {
            judgeName[j]=j+1;
            printf("Judge %d gives score:\n",j+1);
            scanf(" %f",&score[i][j]);
            if(score[i][j]>max)
            {
                max=score[i][j];
            }
            if(score[i][j]<min)
            {
                min=score[i][j];
            }
            judgescore[j][i]=score[i][j];
            sum+=score[i][j];
        }
        finalscore[i]=(sum-max-min)/(judgesNumber-2);
        printf("Delete a maximum score:%.3f\n",max);
        printf("Delete a minimum score:%.3f\n",min);
        printf("The final score of Athlete %d is %.3f",playerName[i],finalscore[i]);
    }
        printf("Order of Athletes:\n");
        printf("order    final score    number code\n");
        for(i=0;i<=judgesNumber-1;i++)
        {
            sum=0;
            for(j=0;j<=playersNumber-1;j++)
            {
                sum+=pow((judgescore[i][j]-finalscore[j]),2);
            }
                sum=sum/playersNumber;
                sum=10-sqrt(sum);
                sum1[i]=sum;
        }
        for(i=0;i<=playersNumber-2;i++)
        {
            for(j=i+1;j<=playersNumber-1;j++)
            {
                if(finalscore[i]<=finalscore[j])
                {
                    tempScore=finalscore[i];
                    finalscore[i]=finalscore[j];
                    finalscore[j]=tempScore;
                    tempName=playerName[i];
                    playerName[i]=playerName[j];
                    playerName[j]=tempName;
                }
            }
        }
        for(i=0;i<=playersNumber-1;i++)
        {
            printf("%5d\t%11.3f\t%6d\n",i+1,finalscore[i],playerName[i]);
        }
        printf("Order of judges:\n");
        printf("order    final score    number code\n");
        for(i=0;i<=judgesNumber-2;i++)
        {
            for(j=i+1;j<=judgesNumber-1;j++)
            {
                if(sum1[i]<=sum1[j])
                {
                    tempScore=sum1[i];
                    sum1[i]=sum1[j];
                    sum1[j]=tempScore;
                    tempName=judgeName[i];
                    judgeName[i]=judgeName[j];
                    judgeName[j]=tempName;
                }min=score[i][0];
            }
        }
        for(i=0;i<=judgesNumber-1;i++)
        {
            printf("%5d\t%11.3f\t%6d\n",i+1,sum1[i],judgeName[i]);
        }
        printf("Over!Thank you!\n");
    return 0;
}

标签:Mooc,finalscore,score,sum,len,哈工大,sum1,printf,统分
来源: https://blog.csdn.net/qq_37500516/article/details/110240676

本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享;
2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关;
3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关;
4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除;
5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。

专注分享技术,共同学习,共同进步。侵权联系[81616952@qq.com]

Copyright (C)ICode9.com, All Rights Reserved.

ICode9版权所有