https://www.patest.cn/contests/pat-a-practise/1011
代码来自 http://blog.csdn.net/jtjy568805874/article/details/50782588
#include <cstdio>
#include <algorithm>
using namespace std;
double x, y, z, ans = 1;
int main()
{
for (int i = 0; i < 3; i++)
{
scanf("%lf%lf%lf", &x, &y, &z);
ans *= max(x, max(y, z));
if (x == max(x, max(y, z))) printf("W ");
else printf("%c ", y > z ? 'T':'L');
}
printf("%.2lf\n", ans*1.3 - 2);
return 0;
}