题目链接:https://www.patest.cn/contests/pat-a-practise/1011
代码如下:
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
char wtl[3]={'W','T','L'};
int no[3]={0,1,2};
double temp[3];
double Max[3]={-1,-1,-1};
int main(){
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
cin>>temp[j];
if(temp[j]>Max[i]){
Max[i]=temp[j];
no[i]=j;
}
}
}
for(int i=0;i<3;i++)
cout<<wtl[no[i]]<<" ";
printf("%.2lf",2*(Max[0]*Max[1]*Max[2]*0.65-1));
return 0;
}