PAT (Advanced Level) Practice 1011 World Cup Betting (20 分)

简介: PAT (Advanced Level) Practice 1011 World Cup Betting (20 分)

题目描述


With the 2010 FIFA World Cup running, football fans the world over were becoming increasingly excited as the best players from the best teams doing battles for the World Cup trophy in South Africa. Similarly, football betting fans were putting their money where their mouths were, by laying all manner of World Cup bets.


Chinese Football Lottery provided a “Triple Winning” game. The rule of winning was simple: first select any three of the games. Then for each selected game, bet on one of the three possible results – namely W for win, T for tie, and L for lose. There was an odd assigned to each result. The winner’s odd would be the product of the three odds times 65%.


For example, 3 games’ odds are given as the following:


W T L

1.1 2.5 1.7

1.2 3.1 1.6

4.1 1.2 1.1


To obtain the maximum profit, one must buy W for the 3rd game, T for the 2nd game, and T for the 1st game. If each bet takes 2 yuans, then the maximum profit would be (4.1×3.1×2.5×65%−1)×2=39.31 yuans (accurate up to 2 decimal places).


Input Specification:


Each input file contains one test case. Each case contains the betting information of 3 games. Each game occupies a line with three distinct odds corresponding to W, T and L.


Output Specification:


For each test case, print in one line the best bet of each game, and the maximum profit accurate up to 2 decimal places. The characters and the number must be separated by one space.


Sample Input:


1.1 2.5 1.7

1.2 3.1 1.6

4.1 1.2 1.1

结尾无空行


Sample Output:


T T W 39.31

结尾无空行


代码


///

#include<cstdio>
int main(){
  char s[3]={'W','T','L'};
  double ans=1.0,tmp,a;
  int idx;
  for(int i=0;i<3;i++)
  {
    tmp=0;
    for(int j=0;j<3;j++)
    {
      scanf("%lf",&a);
      if(a>tmp)
      {
        tmp=a;
        idx=j;
      }
    }
    ans*=tmp;
    printf("%c ",s[idx]);
   } 
   printf("%.2lf",(ans*0.65-1)*2);
}

总结

将s[3]数组存储TTW。

相关文章
|
存储 域名解析 NoSQL
『MongoDB』MongoDB高可用部署架构——分片集群篇(Sharding)
📣读完这篇文章里你能收获到 - 为什么要使用分片 - Mongodb分片集群有哪些特点 - Mongodb分片集群的完整架构 - Mongodb分片集群数据分布方式 - Mongodb分片集群的设计思路 - Mongodb分片集群搭建及扩容 - 这篇文章强烈建议收藏!!!免得下次找不到
5070 2
『MongoDB』MongoDB高可用部署架构——分片集群篇(Sharding)
|
并行计算 调度
多线程的并发和并行
多线程的并发和并行
|
存储 算法 数据管理
数据结构与算法学习二零:二叉排序树(BST)、平衡二叉树(AVL)
这篇文章通过需求分析、代码实现和测试验证,详细介绍了二叉排序树的创建、遍历和删除操作,以及二叉平衡树(AVL)的自平衡特性和单旋转操作,旨在提高树结构在数据管理中的效率和性能。
413 0
数据结构与算法学习二零:二叉排序树(BST)、平衡二叉树(AVL)
|
存储 JavaScript 安全
vue项目打包优化:缩小体积productionSourceMap设置,使用cdn加速
vue项目打包优化:缩小体积productionSourceMap设置,使用cdn加速
1518 0
|
Oracle 关系型数据库
Oracle中decode 以及ROW_NUMBER() OVER() 函数等其它相关函数用法
Oracle中decode 以及ROW_NUMBER() OVER() 函数等其它相关函数用法
493 0
|
存储 Python
python使用gevent库来创建协程,并通过协程实现并发执行不同的任务
```markdown 这段Python代码利用`gevent`库实现并发执行协程。定义了两个打印函数`f1`和`f2`,分别输出&quot;csdn&quot;和&quot;yyds&quot;。代码首先创建列表`t_l`,并启动5个`f1`协程,将其加入列表并等待所有协程完成。随后,同样方式启动5个`f2`协程,存入`t1_l`列表并等待执行完毕。整体展示了`gevent`的协程并发操作。 ```
174 1
|
Linux 网络安全
Linux入门教程以及基础命令拿走点赞收藏
Linux入门教程以及基础命令拿走点赞收藏
196 1
|
小程序 前端开发 安全
大学生党务学习平台|基于微信小程序实现大学生党务学习平台
大学生党务学习平台|基于微信小程序实现大学生党务学习平台
260 0
|
关系型数据库 MySQL 测试技术
|
安全 关系型数据库 MySQL
如何实现MySQL的权限管理
如何实现MySQL的权限管理
132 2