1011. World Cup Betting (20)
来源:互联网 发布:餐饮业数据分析 编辑:程序博客网 时间:2024/05/17 01:42
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 L1.1 2.5 1.71.2 3.0 1.64.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 Input1.1 2.5 1.71.2 3.0 1.64.1 1.2 1.1Sample Output
T T W 37.98
分析:
(1)此题考阅读。。题目长,内容水。
(2)此题唯一的收获是,在思路简单的基础上,打的内容也要简单,像我直接用分支语句完成,最后应为一个b打成a找了好久bug。。
(3)按照题目的输入,输出最后一位是7啊。。为何算出来XX4999999而不是XX500000?
#include <stdio.h>#include <string>#include <iostream>using namespace std;int main(int argc, char *argv[]){string s="WTL";float a[3],b[3],c[3];int d[3];scanf ("%f %f %f",&a[0],&a[1],&a[2]);scanf ("%f %f %f",&b[0],&b[1],&b[2]);scanf ("%f %f %f",&c[0],&c[1],&c[2]); if (a[0]>a[1]&&a[0]>a[2]){d[0]=0;}else if (a[1]>a[0]&&a[1]>a[2]){d[0]=1;}else if (a[2]>a[0]&&a[2]>a[1]){d[0]=2;} if (b[0]>b[1]&&b[0]>b[2]){d[1]=0;}else if (b[1]>b[0]&&b[1]>b[2]){d[1]=1;}else if (b[2]>b[0]&&b[2]>b[1]){d[1]=2;} if (c[0]>c[1]&&c[0]>c[2]){d[2]=0;}else if (c[1]>b[0]&&c[1]>c[2]){d[2]=1;}else if (c[2]>c[0]&&c[2]>c[1]){d[2]=2;} double op; op=(a[d[0]]*b[d[1]]*c[d[2]]*0.65-1)*2; printf("%c %c %c %.2f",s[d[0]],s[d[1]],s[d[2]],op);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)
- hdu 1754 splay tree伸展树 初战(单点更新,区间属性查询)
- POJ 2299 Ultra-QuickSort
- jquery.validate+jquery.form提交的三种方式
- UVA 340 - Master-Mind Hints
- 猴子选大王
- 1011. World Cup Betting (20)
- (二)栈和队列
- 硬件设计问题总结
- linux修改用户主目录的方法
- 《好设计不简单Ⅱ:UI设计师必须了解的那些事》
- 网页链接Oracle实现数据的增删改查--gridview
- linux修改用户主目录的方法
- 常用的生活服务查询接口--使用python
- oracle-数据库(database)与实例(instance)区别