1011. World Cup Betting (20)

时间限制
400 ms

内存限制
65536 kB

代码长度限制
16000 B

判题程序
Standard

作者
CHEN, Yue

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.0  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.0*2.5*65%-1)*2 = 37.98 yuans (accurate up to 2 decimal places).

Input

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

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.0 1.6
4.1 1.2 1.1

Sample Output

T T W 37.98


提交代码

 1 #include <cstdio>
 2 #include <cstring>
 3 #include <string>
 4 #include <queue>
 5 #include <stack>
 6 #include <iostream>
 7 using namespace std;
 8 int main(){
 9     //freopen("D:\\INPUT.txt","r",stdin);
10     double max[3]={-1,-1,-1},num;
11     char c[3]={'W','T','L'},p[3];
12     int i,j;
13     for(i=0;i<3;i++){
14         for(j=0;j<3;j++){
15             cin>>num;
16             if(num>max[i]){
17                 max[i]=num;
18                 p[i]=c[j];
19             }
20         }
21     }
22     printf("%c %c %c %.2lf\n",p[0],p[1],p[2],(max[0]*max[1]*max[2]*0.65-1)*2);
23     return 0;
24 }

转载于:https://www.cnblogs.com/Deribs4/p/4700779.html

pat1011. World Cup Betting (20)相关推荐

  1. 浙江大学PAT上机题解析之1011. World Cup Betting (20)

    1011. World Cup Betting (20) 时间限制  400 ms 内存限制  32000 kB 代码长度限制  16000 B 判题程序    Standard 作者    CHEN ...

  2. 1011. World Cup Betting (20)

    1011. World Cup Betting (20) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Wit ...

  3. PAT (Advanced Level) Practice 1011 World Cup Betting (20 分) 凌宸1642

    PAT (Advanced Level) Practice 1011 World Cup Betting (20 分) 凌宸1642 题目描述: With the 2010 FIFA World Cu ...

  4. 1011 World Cup Betting (20 分)_14行代码AC

    立志用最少的代码做最高效的表达 PAT甲级最优题解-->传送门 With the 2010 FIFA World Cup running, football fans the world ove ...

  5. PAT甲级真题 1011 World Cup Betting (20分) C++实现

    题目 With the 2010 FIFA World Cup running, football fans the world over were becoming increasingly exc ...

  6. 【PAT甲级 ArrayList存放class】1011 World Cup Betting (20 分) Java版 3/3通过 四舍五入保留两位小数

    题目 一共给9个数,3*3,找到每行最大,按照题目要求套算式,计算就行 坑 & 心得 没啥坑,一次通过,用到的知识点是:自定义排序.四舍五入保留两位小数 DecimalFormat df = ...

  7. PAT甲题题解-1011. World Cup Betting (20)-误导人的水题。。。

    题目不严谨啊啊啊啊 式子算出来结果是37.975 样例输出的是37.98 我以为是四舍五入的啊啊啊,所以最后输出的是sum+0.005 结果告诉我全部错误啊 结果直接保留两位小数就可以了啊啊啊啊 水题 ...

  8. 【PAT Advanced Level】1011. World Cup Betting (20)

    简单模拟题,遍历一遍即可.考察输入输出. #include <iostream> #include <string> #include <stdio.h> #inc ...

  9. [PAT A1011]World Cup Betting

    [PAT A1011]World Cup Betting 题目描述 1011 World Cup Betting (20 分)With the 2010 FIFA World Cup running, ...

最新文章

  1. Linux -- Samba访问控制
  2. 1023 组个最小数 (20 分)_14行代码AC
  3. SpringBoot集成FastDFS依赖实现文件上传
  4. 集成学习之参数调整策略
  5. [测试模式]Setup方法的滥用
  6. 在VMware安装Ubuntu 16.04
  7. windows的消息机制
  8. 简单好用的mac版Mysql可视化工具 - Sequel Pro
  9. js中 urlencode编码
  10. 谷歌浏览器xpath插件的安装
  11. R、冗余分析(RDA)、ggplot2、置信椭圆
  12. 【多模态】《Visual7W: Grounded Question Answering in Images》论文阅读笔记
  13. 互联网 HR 黑话大全,太真实了!
  14. 大学计算机372=多少Q,计算机网络Q0831
  15. Logistic Regression 逻辑斯蒂回归
  16. 2023哈尔滨工程大学计算机考研信息汇总
  17. 零经验小白的独游历程——俯视角45度游戏,人物用2D还是3D
  18. 搜狗输入法 linux版本好用,【2345好压和搜狗输入法 For Linux哪个好用】2345好压和搜狗输入法 For Linux对比-ZOL下载...
  19. 有人说Python是青铜?我用50行Python代码绘制3D机场分布图
  20. Swift Web 开发之 Vapor - 模版 Leaf(三)

热门文章

  1. 人的一生有三件事不能等
  2. 了解EOS看这一篇就够了一、团队二、技术三、项目进度四、争议和风险五、展望
  3. vue使用pwa_如何使用HTML,CSS和JavaScript从头开始构建PWA
  4. ruby 新建对象_Ruby面向对象编程的简介
  5. 7纳米duv和euv_要超车台积电 三星宣布采用EUV技术7纳米制程完成验证
  6. python的turtle绘图体系入门必看(二)
  7. ui设计师要懂哪些B端设计原则?
  8. Linux 基金会宣布红队项目,致力于孵化开源安全工具
  9. Thrift RPC 系列教程(4)——源码目录结构组织
  10. Java解压zip文件(文本)压缩包