PAT 1011 World Cup Betting (20分)
With the 2010 FIFA World Cup running, football fans the world over were becoming increasingly excited as the best players from the best teams doing battles for the World Cup trophy in South Africa. Similarly, football betting fans were putting their money where their mouths were, by laying all manner of World Cup bets.
Chinese Football Lottery provided a “Triple Winning” game. The rule of winning was simple: first select any three of the games. Then for each selected game, bet on one of the three possible results – namely W for win, T for tie, and L for lose. There was an odd assigned to each result. The winner’s odd would be the product of the three odds times 65%.
For example, 3 games’ odds are given as the following:
W T L
1.1 2.5 1.7
1.2 3.1 1.6
4.1 1.2 1.1
To obtain the maximum profit, one must buy W for the 3rd game, T for the 2nd game, and T for the 1st game. If each bet takes 2 yuans, then the maximum profit would be (4.1×3.1×2.5×65%−1)×2=39.31 yuans (accurate up to 2 decimal places).
Input Specification:
Each input file contains one test case. Each case contains the betting information of 3 games. Each game occupies a line with three distinct odds corresponding to W, T and L.
Output Specification:
For each test case, print in one line the best bet of each game, and the maximum profit accurate up to 2 decimal places. The characters and the number must be separated by one space.
Sample Input:
1.1 2.5 1.7
1.2 3.1 1.6
4.1 1.2 1.1
Sample Output:
T T W 39.31
大意是说:
给出三行数据,代表三场比赛。每行有三个浮点型数,从左到右分别代表W(Win)、T(Tie)、L(Lose)。现在需要从每行的W、T、F中选择最大的数,并输出各自选择的是哪一个。之后不妨设三行各自的最大的数为a,b,c,计算最大受益即(abc*0,65-1)*2并输出。
#include<cstdio>
int main(){
char S[3]={'W','T','L'};//设置一个字符数组存相应的比赛结果
double ans=1.0,maxn,m;//ans代表最后受益,初始化为1.0,与后面直接相乘即可
int id;
for(int i=0;i<3;i++){
maxn=0.0;//初始化每行最大元素
for(int j=0;j<3;j++){
scanf("%lf",&m);
if(m>maxn){
maxn=m;//比较求出最大值
id=j;//最大数对应的下标
}
}
ans*=maxn;//累乘最大值
printf("%c ",S[id]);//依次输出每组的最大值
}
printf("%.2f\n",(ans*0.65-1)*2);//输出最后收益
return 0;
}