PAT_1011.World Cup Betting
2017-02-14 10:22
441 查看
// 1011_World Cup Betting.cpp : 定义控制台应用程序的入口点。 //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 #include "stdafx.h" #include "stdio.h" #include "iostream" #include "string.h" #include "stdlib.h" #include "string" #include "algorithm" using namespace std; int main() { float temp,result,max; char a[3]; max = 0.00; result = 1.00; for(int i = 0;i<3;i++){ for(int j = 0;j<3;j++){ cin>>temp; if(max<temp){ switch(j){ case 0:a[i] = 'W'; break; case 1:a[i] = 'T'; break; case 2:a[i] = 'L'; break; } max = temp; } } result *= max; max = 0.00; } for(int i =0;i<3;i++) cout<<a[i]<<" "; printf("%.2lf\n",(result*0.65-1)*2); return 0; }
相关文章推荐
- 【HDU 5366】The mook jong 详解
- 【水题】跑跑卡丁车系列之游戏下载
- HDU 5240 Exam (好水的题)
- poj-3299 Humidex 水题,推公式
- POJ - 2159 Ancient Cipher 水题 字符统计
- 【2016 Multi-University Training Contest 1】【hdu5723】Abandoned Countries
- 【WHUST 2016 Individual Contest #2】解题报告
- 【WHUST 2016 Individual Contest #3 】解题报告
- 【2016 Multi-University Training Contest 6】【1002】【A Simple Chess】
- 北大—1006——Biorhythms
- codeforces 1B Spreadsheets
- 时间计算(heaven.pas/cpp)
- 工作依赖(job.cpp/pas)
- 题目 英雄 (BFS)
- kmp 学习 hihocoder #1015
- HDU 1096 A+B for Input-Output Practice (VIII)
- [DP46题] HDU 1864 最大报销额
- USACO Your Ride Is Here
- [USACO]1.2.2Milking Cows
- HUST-1601 - Shepherd 暴力