pat_1011

来源：互联网发布：linux mint chromium 编辑：程序博客网时间：2024/05/29 16:57

源地址：http://www.patest.cn/contests/pat-a-practise/1011

题目大意很好懂，也很好做，水题。

#include<stdio.h>#include<iostream>#include<string>#include<string.h>#include<algorithm>#include<iomanip>#include<vector>#include<time.h>#include<queue>#include<stack>#include<iterator>#include<math.h>#include<stdlib.h>#include<limits.h>#include<set>#include<map>//#define ONLINE_JUDGE#define eps 1e-3#define INF 0x7fffffff#define FOR(i,a) for((i)=0;i<(a);(i)++)#define MEM(a) (memset((a),0,sizeof(a)))#define sfs(a) scanf("%s",a)#define sf(a) scanf("%d",&a)#define sfI(a) scanf("%I64d",&a)#define pf(a) printf("%d\n",a)#define pfI(a) printf("%I64d\n",a)#define pfs(a) printf("%s\n",a)#define sfd(a,b) scanf("%d%d",&a,&b)#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)#define for1(i,a,b) for(int i=(a);i<b;i++)#define for2(i,a,b) for(int i=(a);i<=b;i++)#define for3(i,a,b)for(int i=(b);i>=a;i--)#define MEM1(a) memset(a,0,sizeof(a))#define MEM2(a) memset(a,-1,sizeof(a))const double PI=acos(-1.0);template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}template<class T> inline T Min(T a,T b){return a<b?a:b;}template<class T> inline T Max(T a,T b){return a>b?a:b;}using namespace std;#define ll long longint n,m;#define Mod 1000000007#define N 510#define M 1000100const int size = 10010;const int mod = 9901;int main(){#ifndef ONLINE_JUDGE    freopen("in.txt","r",stdin);//  freopen("out.txt","w",stdout);#endif    double a,b,c;    double ans = 1.0;    for(int i=0;i<3;i++){    scanf("%lf%lf%lf",&a,&b,&c);    double mmax = Max(a,Max(b,c));    ans *= mmax;    if(i) printf(" ");    if(mmax == a)    printf("W");    else if(mmax == b)    printf("T");    else if(mmax == c)    printf("L");    }    printf(" %.2f\n",(ans*0.65-1.0)*2.0);return 0;}

0 0