1011. World Cup Betting (20)
来源:互联网 发布:java 百度地图api接口 编辑:程序博客网 时间:2024/06/06 12:48
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
#include<cstdio>#include<cstdlib>#include<cstring>const char gameresults[3]={'W','T','L'};double input[3][3];int result[3];int findmaxindex(double input[]);int main(void){int i,j;double product = 1;for(i=0;i<3;++i){for(j=0;j<3;++j){scanf("%lf",&input[i][j]);}result[i] = findmaxindex(input[i]);product *= input[i][result[i]];}for(i=0;i<3;++i)printf("%c ",gameresults[result[i]]);printf("%.2f",(product*0.65 - 1)*2);system("pause");return 0;}int findmaxindex(double input[]){int max = 0;for(int i=1;i<3;++i){if(input[i] > input[max])max = i;}return max;}
- 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)
- C++解引用运算符*重载
- Java NIO - 非阻塞 IO和复用
- android studio 中使用aidl
- OC中的枚举
- LintCode-剑指Offer-(69)二叉树的层次遍历
- 1011. World Cup Betting (20)
- coderforce 2057B Amr and Pins
- bzoj1058【zjoi2007】报表统计
- LintCode-剑指Offer-(70)二叉树的层次遍历Ⅱ
- 学习npm
- 【BLE】CC2541之timer3
- iOS 定位服务编程详解
- 当一个线程进入一个synchronized方法后,其它线程是否可以进入
- JavaScript学习之路05_Iterator