PAT 1011. World Cup Betting (20)(浮点数乘法)
来源:互联网 发布:淘宝三大苹果店 编辑:程序博客网 时间:2024/05/29 18:56
题目
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
AC代码
#include<algorithm>#include<cstdio>#include<vector>using namespace std;const double eps = 1.e-8;char int2c[] = {'W','T','L'};vector<int> choose;double findMax(double a,double b,double c){ int k = 0; double m = a; if (m<b) { m = b; k = 1; } if(m<c){ m = c; k = 2; } //printf("%c",int2c[k]); choose.push_back(k); return m;}int main(int argc, char *argv[]){ double w,t,l,product = 1.; for (int i = 0; i < 3; ++i) { scanf("%lf %lf %lf",&w,&t,&l); double m = findMax(w,t,l); product = product * m + eps; } printf("%c %c %c %.2f\n",int2c[choose[0]],int2c[choose[1]],int2c[choose[2]],(product*0.65-1)*2. + eps); //printf("%c",int2c[0]); return 0;}
- PAT 1011. World Cup Betting (20)(浮点数乘法)
- 1011. World Cup Betting (20)-PAT
- 【PAT】1011. World Cup Betting (20)
- PAT 1011. World Cup Betting (20)
- PAT A 1011. World Cup Betting (20)
- PAT 1011. World Cup Betting (20)
- [PAT]1011. World Cup Betting (20)
- PAT 1011. World Cup Betting (20)
- PAT 1011. World Cup Betting (20)
- pat 1011. World Cup Betting (20)
- PAT 1011. World Cup Betting (20)
- [PAT]1011. World Cup Betting (20)
- PAT甲级.1011. World Cup Betting (20)
- 1011. World Cup Betting (20) PAT 甲级
- PAT甲 1011. World Cup Betting (20)
- 【PAT甲级】1011. World Cup Betting (20)
- PAT-A 1011. World Cup Betting (20)
- PAT甲级1011. World Cup Betting (20)
- android常见面试模块
- 20位活跃在Github上的国内技术大牛
- C语言内存管理
- Java-TCP/IP 编程-01 主线程:从控制台录入消息,发送到服务器 子线程:接收服务器转发来的消息
- 2 json与json字符串
- PAT 1011. World Cup Betting (20)(浮点数乘法)
- Java-TCP/IP编程-02 * 客户端: 主线程:从控制台录入消息,发送到服务器 子线程:接收服务器转发来的消息
- iOS开发系列--打造自己的“美图秀秀”
- Java-TCP/IP编程-03 消息群发功能
- 【类库】java时间操作类库:Joda-Time
- 《OpenGL ES 2.0 Programming Guide》第9章 “最简单的本地纹理显示”示例代码【C语言版】
- Java-TCP/IP编程-04 带窗口的群聊天功能
- 文件结构图
- CodeForces 148BEscape