Programming Ability Test study 1011. World Cup Betting (20)

1011 World Cup Betting (20) time limit MS Memory limit 65536 KB code length limit 16000 B award Program StandardAuthor Chen, Yue

With the all FIFA world Cup running, football fans the world over were becoming increasingly excited as the best players The teams doing battles for the World Cup Trophy on South Africa. Similarly, football betting fans were putting their money where their mouths were, by laying all manner of the world Cup bets.

Chinese Football Lottery provided a "Triple Winning" game. The rule of winning is 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 a odd assigned to each result. The winner ' s odd would be the product of the three odds times 65%.

For example, 3 games ' odds is 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 and then the maximum profit would be (4.1*3.0*2.5*65%-1) * = 37.98 Yuans (accurate up to 2 decimal Places).

Input

Each input file contains the 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 is 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

Submit Code

#include <iostream> #include <cstdio> #include <cmath> #include <cstdlib> #include <cstring > #include <string> #include <algorithm> #include <map> #define MAXSIZE 100005typedef long ll;    Using namespace std;typedef struct node{double val; char c; }node;typedef struct Nnode{node a[3];} nnode;//******* commonly used basic functions *******//******* to function *******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) * *;} int main () {nnode aa[3];d ouble 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\n", Getpro (A[0],a[1],a[2])); return 0;}

　　

Programming Ability Test study 1011. World Cup Betting (20)