PAT1011. World Cup Betting (20)
来源:互联网 发布:hp网络打印机怎么连接 编辑:程序博客网 时间:2024/06/07 09:43
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 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
basic题目
#include <iostream>#include <algorithm>#include <string>#include <iomanip>using namespace std;string ss[3] = {"W", "T", "L"};int main(){ ios::sync_with_stdio(false); double s[3]; while(cin>>s[0]>>s[1]>>s[2]) { double maxn1=0; int a, b, c; for(int i=0;i<3;++i) { if(maxn1 < s[i]) { maxn1 = s[i]; a = i; } } double maxn2=0; for(int i=0;i<3;++i) { cin>>s[i]; if(maxn2 < s[i]) { maxn2 = s[i]; b = i; } } double maxn3 = 0; for(int i=0;i<3;++i) { cin>>s[i]; if(maxn3 < s[i]) { maxn3 = s[i]; c = i; } } //cout<<fixed<<setprecision(1)<<maxn1<<" "<<fixed<<setprecision(1)<<maxn2<<" "<<fixed<<setprecision(1)<<maxn3<<endl; cout<<ss[a]<<" "<<ss[b]<<" "<<ss[c]<<" "<<fixed<<setprecision(2)<<(maxn1*maxn2*maxn3*0.65-1)*2<<endl; } return 0;}
- PAT1011. World Cup Betting (20)
- PAT1011. World Cup Betting (20)
- PAT1011. World Cup Betting
- PAT1011 World Cup Betting
- pat1011 World Cup Betting
- PAT1011 World Cup Betting
- 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)
- ubuntu/deepin搭建svn服务器
- jquery 判断中文字符的长度
- sqlserver2008 数据备份,初始化所有数据从主数据库到备份数据库
- LibQQt系列之二《How to build LibQQt》
- BZOJ刷题记录
- PAT1011. World Cup Betting (20)
- spring boot + mybatis + spring security(自定义登录界面)环境搭建
- poj-3468-A Simple Problem with Integers(树状数组更新区间查区间)
- 第14周项目1-1
- 何时使用@()
- 1295插入整形数组
- QListWidget
- 416. Partition Equal Subset Sum
- SHA/HMAC/AES-CBC/CTR 算法执行效率及RAM消耗 测试结果