PAT A 1011. World Cup Betting (20)

本文介绍了一个简单的足球彩票投注策略,通过选择三场比赛并针对每场比赛的胜、平、负三种可能结果进行投注来获取最大利润。示例展示了如何计算最佳投注组合及预期的最大收益。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

题目

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 <iostream>
using namespace std;

int main()
{
	double profit=1.000;
	double odd[3][3];
	int i,j;
	int choice;
	char res[3]={'W','T','L'};

	for(i=0;i<3;i++)
		for(j=0;j<3;j++)
			cin>>odd[i][j];

	for(i=0;i<3;i++)
	{
		choice=0;
		for(j=0;j<3;j++)
		{
			if(odd[i][j]>odd[i][choice])
				choice=j;
		}
		cout<<res[choice]<<" ";
		profit*=odd[i][choice];
	}
	
	profit=(profit*0.650-1.000)*2.000;	//!!!此处用示例在VS2010测试获得结果有偏差,不清楚原因
	cout<<fixed;
	cout.precision(2);
	cout<<profit;
	
	return 0;
}


 

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值