1011. World Cup Betting (20)
来源:互联网 发布:如何设置hp网络打印机 编辑:程序博客网 时间:2024/06/18 14:49
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.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
这是史上题目最长,但是最简单的一大题目了……就是比较大小,然后按照题中的公式输出结果就可以了。
代码如下:
#include <iostream>using namespace std;int main(int argc, const char * argv[]) { double game[3][3]; for (int i = 0; i < 3; ++i) { for (int j = 0; j < 3; ++j) { cin >> game[i][j]; } } //开始选取每一个比赛的投标 int betting[3]; int pro = 0; for (int i = 0; i < 3; ++i) { for (int j = 0; j < 3; ++j) { if (game[i][pro] < game[i][j]) { pro = j; } } betting[i] = pro; } //输出 double profit = (game[0][betting[0]] * game[1][betting[1]] * game[2][betting[2]] * 0.65 - 1) * 2; string result[3] = {"W", "T", "L"}; cout << result[betting[0]] << " " << result[betting[1]] << " " <<result[betting[2]]; printf(" %.2f\n", profit); return 0;}
- 1011. World Cup Betting (20)
- 1011. World Cup Betting (20)
- 1011. World Cup Betting (20)
- 1011. World Cup Betting (20)
- 1011. World Cup Betting (20)
- 1011. World Cup Betting (20)
- 1011. World Cup Betting (20)
- 1011. World Cup Betting (20)
- 1011. World Cup Betting (20)
- 1011. World Cup Betting (20)
- 1011. World Cup Betting (20)
- 1011. World Cup Betting (20)
- 1011. World Cup Betting (20)
- 1011. World Cup Betting (20)
- 1011. World Cup Betting (20)
- 1011. World Cup Betting (20)
- 1011. World Cup Betting (20)
- 1011. World Cup Betting (20)
- 2.数理统计与参数估计
- xargs命令
- HTTP返回状态码总结
- 数据结构_线性表_链式存储_单链表 的基本操作
- 【GOF23设计模式】_建造者模式详解_类图关系JAVA232
- 1011. World Cup Betting (20)
- 同步/异步、阻塞/非阻塞
- java使用FileReader读取一个.java文件,并打印在控制台上。
- 熟练掌握HTML5开发中常用五大CSS选择器用法
- iOS开发中常用到的加密方式
- Android开发转型公司技术负责人是一种怎样的体验
- 矩阵相乘的Strassen算法
- JAVA泛型
- Java源文件的编译、下载、解释和执行