pat1011. World Cup Betting (20)
发布日期:2025-05-01 23:08:27 浏览次数:2 分类:技术文章

本文共 2157 字,大约阅读时间需要 7 分钟。

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    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 Input
1.1 2.5 1.71.2 3.0 1.64.1 1.2 1.1
Sample Output
T T W 37.98

 

1 #include 
2 #include
3 #include
4 #include
5 #include
6 #include
7 using namespace std; 8 int main(){ 9 //freopen("D:\\INPUT.txt","r",stdin);10 double max[3]={-1,-1,-1},num;11 char c[3]={ 'W','T','L'},p[3];12 int i,j;13 for(i=0;i<3;i++){14 for(j=0;j<3;j++){15 cin>>num;16 if(num>max[i]){17 max[i]=num;18 p[i]=c[j];19 }20 }21 }22 printf("%c %c %c %.2lf\n",p[0],p[1],p[2],(max[0]*max[1]*max[2]*0.65-1)*2);23 return 0;24 }

 

转载于:https://www.cnblogs.com/Deribs4/p/4700779.html

上一篇:pat1057. Stack (30)
下一篇:PAT-乙级-1040 有几个PAT

发表评论

最新留言

网站不错 人气很旺了 加油
[***.192.178.218]2025年04月27日 22时30分02秒

关于作者

    喝酒易醉,品茶养心,人生如梦,品茶悟道,何以解忧?唯有杜康!
-- 愿君每日到此一游!

推荐文章