国产探花免费观看_亚洲丰满少妇自慰呻吟_97日韩有码在线_资源在线日韩欧美_一区二区精品毛片,辰东完美世界有声小说,欢乐颂第一季,yy玄幻小说排行榜完本

首頁 > 學院 > 開發(fā)設計 > 正文

PAT A1011. World Cup Betting (20)

2019-11-14 09:56:19
字體:
來源:轉載
供稿:網友

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.1Sample Output
T T W 37.98
#include <cstdio>#include <algorithm>#define Max 123400using namespace std;struct game{ double w; double t; double f;}G[3];double most(double a,double b,double c){	double fl;	if(a>c)		fl=a;	else fl=c;	if(b>fl)		fl=b;	return fl;}int main(){	double sum=1.0;	char f[4];	for(int i=0;i<3;i++)	{		scanf("%lf %lf %lf",&G[i].w,&G[i].t,&G[i].f);		double f1=most(G[i].w,G[i].t,G[i].f);		if(G[i].w==f1) 		{			f1=G[i].w;			f[i]='W';		}		else if(G[i].t==f1) 		{			f1=G[i].t;			f[i]='T';		}		else if(G[i].f==f1) 		{			f1=G[i].f;			f[i]='L';		}		sum*=f1;	}	printf("%c %c %c %.2f",f[0],f[1],f[2],(sum*0.65-1)*2);    system("pause");	return 0;}
發(fā)表評論 共有條評論
用戶名: 密碼:
驗證碼: 匿名發(fā)表
主站蜘蛛池模板: 封丘县| 汶上县| 乡城县| 聊城市| 河曲县| 永登县| 台南市| 礼泉县| 镇安县| 德清县| 英吉沙县| 鄱阳县| 察哈| 玉山县| 宁远县| 稷山县| 丰都县| 隆德县| 伊春市| 丽水市| 荆州市| 岳阳县| 汶上县| 武汉市| 胶南市| 缙云县| 山丹县| 娄底市| 肇州县| 兰州市| 大余县| 莫力| 锡林浩特市| 中阳县| 河源市| 通江县| 绵阳市| 台州市| 邢台市| 合水县| 五大连池市|