PAT1011:World Cup Betting

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

思路
很简单，找出每次比赛三种结果的最大赔率的那次结果，每三次比赛输出一下利润，套公式即可。需要特别注意保留n位小数时四舍五入和float转int的坑。
代码

#include<iostream>
#include<vector>
#include<math.h>
using namespace std;
char a[] = "WTL";
const float t = 0.65;
const float point = 0.5;

int main()
{
  vector<float> bet();
  vector<float> maxodd();
  vector<char> result;
  int N = ;
  while(cin >> bet[] >> bet[] >> bet[])
  {
     int pos = ;
     if(max(bet[],bet[]) < bet[])
     {
         maxodd[N++] = bet[];
         pos = ;
     }
     else if(bet[] > bet[])
     {
         maxodd[N++] = bet[];
         pos = ;
     }
     else
     {
         maxodd[N++] = bet[];
         pos = ;
     }
     result.push_back(a[pos]);
     if(N == )
     {
        float profit =  * (maxodd[] * maxodd[] * maxodd[] * t - ) + point;
        int temp = (int)profit;
        float maxprofit = ((float)temp)/;
        for(int i = ;i < ;i++)
            cout << result[i] << " ";
        cout << maxprofit << endl;
        N = ;
     }
  }
}