PAT A1011 World Cup Betting

1011 World Cup Betting

分数 20

作者 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.1  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.1×2.5×65%−1)×2=39.31 yuans (accurate up to 2 decimal places).

Input Specification:

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 Specification:

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.1 1.6
4.1 1.2 1.1

Sample Output:

T T W 39.31

 

 * 输入九个浮点数，每三个浮点数位一组，从每组中选择最大的数，并且输出下标对应的编号
 * （W,T,L)，输入可以用map来存储，编号亦可以用map来处理，具体看代码实现。

/*** 输入九个浮点数，每三个浮点数位一组，从每组中选择最大的数，并且输出下标对应的编号* （W,T,L)，输入可以用map来存储，编号亦可以用map来处理，具体看代码实现。
*/#include <iostream>
#include <map>
#include <vector>using namespace std;const int INF = 1e9;int main()
{map<int, double> mp;for(int i=0; i<9; ++i){double db;cin >> db;mp[i] = db;}vector<int> vec;for(int i=0; i<9; i+=3){int maxid = i; //最大下标double maxv = -INF; //最大值for(int j=i, k=0; k<3; ++j, ++k){if(mp[j] > maxv){maxv = mp[j];maxid = j;}}vec.push_back(maxid);}map<int, string> op = {{0, "W"}, {1, "T"}, {2, "L"}};double res = 1;for(int i=0; i<3; ++i){int id = vec[i];cout << op[id % 3] << ' ';res *= mp[id];}res *= 0.65;res = (res - 1) * 2;printf("%.2f\n", res);return 0;
}