1011 World Cup Betting (20分)

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
int n,low,high;
const int maxn = 100001;


int main()
{
    freopen("1.txt","r",stdin);
    double mx = 0;
    double mon[maxn] = {0};
    fill(mon,mon+10,0);
    int id = 0;
    for(int i = 0;i<3;i++)
    {
        mx = 0;
        double f = -1;
        for(int j = 0;j<3;j++)
        {
            double t;
            scanf("%lf",&t);
            if(t > mx)
            {
                mx = t;
                f = j;
            }
        }
        mon[id++] = mx;
        if(f == 0)
            printf("W ");
        else if(f==1)
            printf("T ");
        else
            printf("L ");
    }
    double ans = 1;
    for(int i = 0;i<id;i++)
    {
        ans*=mon[i];
    }
    ans = (ans * 0.65 - 1) * 2;
    printf("%.2f",ans);
    return 0;
}