Programming Ability Test学习 1011. World Cup Betting (20)

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<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<string>
#include<algorithm> 
#include<map>
#define MAXSIZE 100005
typedef long long ll;

using namespace std;


typedef struct Node{
	double val;
    char c; 
}node;

typedef struct NNode{
	node a[3];
}nnode;


//*******常用基本函数*******


//*******本题用到函数*******
double Max(double a,double b)
{
	return a>b?a:b;
}

double GetPro(double a,double b,double c)
{
	return (0.65*a*b*c-1)*2;
}


int main()
{
	nnode AA[3];
	double a[3];
	int jk=0;
	for(int i=0;i<3;i++)
	{
		cin>>AA[i].a[0].val>>AA[i].a[1].val>>AA[i].a[2].val;
		AA[i].a[0].c='W';
		AA[i].a[1].c='T';
		AA[i].a[2].c='L';
	}

    for(int i=0;i<3;i++)
    {
    	double k=Max(Max(AA[i].a[0].val,AA[i].a[1].val),AA[i].a[2].val);
    	if(k==AA[i].a[0].val)cout<<AA[i].a[0].c<<" ";
    	if(k==AA[i].a[1].val)cout<<AA[i].a[1].c<<" ";
    	if(k==AA[i].a[2].val)cout<<AA[i].a[2].c<<" ";
    	a[jk++]=k;
    }
    //cout<<a[0]<<" "<<a[1]<<" "<<a[2]<<endl;
    printf("%.2lf
",GetPro(a[0],a[1],a[2]));
	return 0;
}