题目链接：传送门

emm无脑模拟，随便做就好

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<string>
#include<algorithm>
#include<iostream>
#include<map>
#include<set>
#include<queue>
#include<stack>
#define inf 4000000000000000000
using namespace std;
typedef long long ll;
const ll maxn=1e6+50;
const ll mod=1e9+7;
const double eps=1e-9;

int main()
{
	double sum=1;
	char s[4];
	for(ll i=1;i<=3;i++)
	{
		double w,t,l;
		scanf("%lf %lf %lf",&w,&t,&l);
		if(t>w&&t>l)s[i]='T',sum*=t;
		else if(w>t&&w>l)s[i]='W',sum*=w;
		else if(l>w&&l>t)s[i]='L',sum*=l;
	}
	sum=(sum*0.65-1)*2;
	for(ll i=1;i<=3;i++)printf("%c ",s[i]);
	printf("%.2lf\n",sum);
	//scanf("%lld",&n);
	return 0;
}