当前位置: 首页 > news >正文

wordpress搜索收录/外贸建站优化

wordpress搜索收录,外贸建站优化,wordpress怎样更改文章阅读次数,字体设计免费版在线立即生成大奖赛现场统分。已知某大奖赛有n个选手参赛,m(m>2)个评委为参赛选手评分(最高10分,最低0分)。统分规则为:在每个选手的m个得分中,去掉一个最高分和一个最低分后,取平…

大奖赛现场统分。已知某大奖赛有n个选手参赛,m(m>2)个评委为参赛选手评分(最高10分,最低0分)。统分规则为:在每个选手的m个得分中,去掉一个最高分和一个最低分后,取平均分作为该选手的最后得分。要求编程实现:
(1)根据n个选手的最后得分,从高到低输出选手的得分名次表,以确定获奖名单;
(2)根据各选手的最后得分与各评委给该选手所评分数的差距,对每个评委评分的准确性和评分水准给出一个定量的评价,每位评委的评分方法:(10 -(评委对选手x的评分 - x的得分)^2 的累加和),从高到低输出各评委得分的名次表。

程序运行示例如下:
How many Athletes?5
How many judges?5
Scores of Athletes:
Athlete 1 is playing.
Please enter his number code:11
Judge 1 gives score:9.5
Judge 2 gives score:9.6
Judge 3 gives score:9.7
Judge 4 gives score:9.4
Judge 5 gives score:9.0
Delete a maximum score:9.7
Delete a minimum score:9.0
The final score of Athlete 11 is 9.500

Athlete 2 is playing.
Please enter his number code:12
Judge 1 gives score:9.0
Judge 2 gives score:9.2
Judge 3 gives score:9.1
Judge 4 gives score:9.3
Judge 5 gives score:8.9
Delete a maximum score:9.3
Delete a minimum score:8.9
The final score of Athlete 12 is 9.100

Athlete 3 is playing.
Please enter his number code:13
Judge 1 gives score:9.6
Judge 2 gives score:9.7
Judge 3 gives score:9.5
Judge 4 gives score:9.8
Judge 5 gives score:9.4
Delete a maximum score:9.8
Delete a minimum score:9.4
The final score of Athlete 13 is 9.600

Athlete 4 is playing.
Please enter his number code:14
Judge 1 gives score:8.9
Judge 2 gives score:8.8
Judge 3 gives score:8.7
Judge 4 gives score:9.0
Judge 5 gives score:8.6
Delete a maximum score:9.0
Delete a minimum score:8.6
The final score of Athlete 14 is 8.800

Athlete 5 is playing.
Please enter his number code:15
Judge 1 gives score:9.0
Judge 2 gives score:9.1
Judge 3 gives score:8.8
Judge 4 gives score:8.9
Judge 5 gives score:9.2
Delete a maximum score:9.2
Delete a minimum score:8.8
The final score of Athlete 15 is 9.000
Order of Athletes:
order final score number code
1 9.600 13
2 9.500 11
3 9.100 12
4 9.000 15
5 8.800 14
Order of judges:
order final score number code
1 9.980 1
2 9.960 2
3 9.900 3
4 9.860 4
5 9.590 5
Over!Thank you!

— 这么长的题目!!—


代码在此:每一步都要知道自己干什么,不要因为题目长就慌了神


#include  <stdio.h>
#include  <math.h>
#define ATHLETE	40           					/* 选手人数最高限 */
#define JUDGE 	     20           					/* 评委人数最高限 */
void  CountAthleteScore(int sh[], float sf[], int n, float f[], int m);
void  Sort(int h[], float f[], int n);
void  Print(int h[], float f[], int n);
void  CountJudgeScore(int ph[], float pf[], int m, float sf[], float f[],int n);
int main()
{   	 	   int  j, m, n;int  sh[ATHLETE];  							/* 选手的编号 */int  ph[JUDGE];   							/* 评委的编号 */float  sf[ATHLETE];  						/* 选手的最后得分 */float  pf[JUDGE];    						/* 评委的得分 */float  f[ATHLETE][JUDGE]; 					/* 评委给选手的评分 */printf("How many Athletes?");scanf("%d", &n);                      			/* 输入选手人数 */printf("How many judges?");scanf("%d", &m);                      			/* 输入评委人数 */for (j = 1; j <= m; j++){   	 	   ph[j] = j;}printf("Scores of Athletes:\n");CountAthleteScore(sh, sf, n, *f, m); 		/* 现场为选手统计分数 */CountJudgeScore(ph, pf, m, sf, *f, n); 		/* 为各个评委打分 */printf("Order of Athletes:\n");Sort(sh, sf, n);                      			/* 选手得分排序 */Print(sh, sf, n);                     			/* 打印选手名次表 */printf("Order of judges:\n");Sort(ph, pf, m);                      			/* 评委得分排序 */Print(ph, pf, m);                     			/* 打印评委名次表 */printf("Over!Thank you!\n");return 0;
}   	 	   
/* 函数功能:统计参赛选手的得分 */
void  CountAthleteScore(int sh[], float sf[], int n, float f[], int m)
{   	 	   int  i, j;float  max, min;for (i = 1; i <= n; i++)                     /* 第i个选手 */{   	 	   printf("\nAthlete %d is playing.", i);printf("\nPlease enter his number code:");scanf("%d", &sh[i]);sf[i] = 0;max = 0;                                /* 最高分初值设为最小值 */min = 100;                              /* 最低分初值设为最大值 */for (j = 1; j <= m; j++)              /* 第j个评委 */{   	 	   printf("Judge %d gives score:", j);scanf("%f", &f[i * m + j]);sf[i] = sf[i] + f[i * m + j];   /* 累加评委对第i个选手的评分 */if (max < f[i * m + j])          /* 找出最高分 */{   	 	   max = f[i * m + j];}if (min > f[i * m + j])          /* 找出最低分 */{   	 	   min = f[i * m + j];}}printf("Delete a maximum score:%.1f\n", max);printf("Delete a minimum score:%.1f\n", min);sf[i] = (sf[i] - max - min) / (m - 2); /*去掉一个最高分和最低分*/printf("The final score of Athlete %d is %.3f\n", sh[i], sf[i]);}
}   	 	   
/* 函数功能:对分数从高到低排序 */
void Sort(int h[], float f[], int n)
{   	 	   int  i, j, k, temp2;float  temp1;for (i = 1; i <= n - 1; i++){   	 	   k = i;for (j = i + 1; j <= n; j++){   	 	   if (f[j] > f[k])  k = j;}if (k != i){   	 	   temp1 = f[k];f[k] = f[i];f[i] = temp1;temp2 = h[k];h[k] = h[i];h[i] = temp2;}}
}   	 	   
/* 函数功能:打印名次表 */
void Print(int h[], float f[], int n)
{   	 	   int  i;printf("order\tfinal score\tnumber code\n");for (i = 1; i <= n; i++){   	 	   printf("%5d\t%11.3f\t%6d\n", i, f[i], h[i]);}
}   	 	   
/* 函数功能:统计评委的得分 */
void CountJudgeScore(int ph[], float pf[], int m, float sf[], float f[],int n)
{   	 	   int  i, j;for (j = 1; j <= m; j++)         /* 第j个评委 */{   	 	   pf[j] = 0;for (i = 1; i <= n; i++)    /* 第i个选手 */{   	 	   pf[j] = pf[j] + (f[i * m + j] - sf[i]) * (f[i * m + j] - sf[i]);}pf[j] = 10 - pf[j];}
}   	 	   

当初没学这么多的时候,我甚至想直接硬破解

思路:

清晰的头脑,逻辑顺序,写的格式!!

http://www.lbrq.cn/news/1419481.html

相关文章:

  • 没有数据怎么做网站/360网站关键词排名优化
  • 做那种网站赚钱/莆田seo推广公司
  • 农村电商网站建设方案/网络营销方法有哪些举例
  • wordpress付费查看全文内容/seo百度推广
  • 嘉兴建设网站/适合网络营销的产品
  • 注册完域名后如何做网站/在线h5免费制作网站
  • 几个做ppt的网站知乎/seo教程网
  • 做网站为什么没收入/群排名优化软件官网
  • shopbase建站费用/手机如何制作自己的网站
  • 做网站设计需要具备哪些/北京网络营销咨询公司
  • 网站你懂我意思正能量晚上在线下载免费软件魅族/seo网站优化教程
  • 网站注册商是什么/上海百度搜索优化
  • 西安网站制作哪家便宜又好/上海还能推seo吗
  • 公司企业邮箱是什么/网站优化推广公司排名
  • 科技资讯网站开发/企业seo排名外包
  • 海淀区网站制作公司/手机如何制作网页
  • 深圳那家做网站好/宁波pc营销型网站制作
  • 网站开发用的软件/seo优化操作
  • 广州网站建设电话/谷歌浏览器网址
  • 徐州网站制作怎样/什么网站可以发布广告
  • 做网站源代码/海外推广营销 平台
  • 泛搜索wordpress/seo高端培训
  • 建设实业公司网站设计模板/seo零基础入门到精通200讲
  • 兼职做效果图的网站/我要下载百度
  • 厦门百度整站优化服务/广告联盟app推广
  • 网站的开发与维护/免费推广的app有哪些
  • 网站设计要学什么/企排排官网
  • seo公司排行/网站seo诊断分析报告
  • 湖北网站建设多少钱/百度做网站推广的费用
  • 靠做效果图赚钱的网站/微博营销成功案例8个
  • Java 大视界 -- Java 大数据分布式计算在基因测序数据分析与精准医疗中的应用(400)
  • nodejs 错误处理
  • 北京JAVA基础面试30天打卡11
  • Netty 的 Select/Poll 机制核心实现主要在 NioEventLoop 的事件循环
  • 数据结构:二叉平衡树
  • [1Prompt1Story] 注意力机制增强 IPCA | 去噪神经网络 UNet | U型架构分步去噪