题1011

版权声明：// Copyright © 2018年 Coding18. All rights reserved. https://blog.csdn.net/Coding18/article/details/85989340

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
float a[3][3];
char w[3] = {'W','T','L'}; 
int main()
{
	for(int i = 0; i < 3; i++)
	{
		for(int j = 0; j < 3; j++){
			scanf("%f",&a[i][j]);
		}
	}
	float sum = 1;
    for(int i = 0; i < 3; i++)
    {
    	int u = -1;
    	float max = -1;
    	for(int j = 0; j < 3; j++){
    		if(a[i][j] > max)
    		{
    			max = a[i][j];
    			u = j;
    		}
    	}
    	sum *= max;
    	printf("%c ",w[u]);

    }
	printf("%.2f",(sum * 0.65-1) * 2);
	return 0;
}