点击链接PAT甲级-AC全解汇总

题目：
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
1
2
3

Sample Output:

T T W 39.31
1

题意：
输入一共三行，每行三个数，找到最大，三个位置分别输出W T L.，三个数记为a b c ，代入公式(a×b×c×65%−1)×2输出精确到小数点后两位

我的代码：

#include
using namespace std;

int main()
{
    double ans=1;
    for(int i=0;i<3;i++)
    {
        double a,b,c;
        cin>>a>>b>>c;
        if(a>b&&a>c)
        {
            cout<<"W ";
            ans*=a;
        }
        else if(b>a&&b>c)
        {
            cout<<"T ";
            ans*=b;
        }
        else if(c>a&&c>b)
        {
            cout<<"L ";
            ans*=c;
        }
    }
    printf("%.2f",(1.3*ans-2));
    return 0;
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30