题目:
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, andL
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, andT
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
andL
.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
题目大意:赌球(bets),给出三局比赛的W,T,L,计算出,选出每一局比赛赔率最大的那一个(按行处理),根据计算公式得到利润。
解题思路:按行处理,找出每行的最大值,累乘即可。
代码:
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
double w,t,l,max;
int n=3;
double sum=1.00;
char flag;
//freopen("input.txt","r",stdin);
while(n--){
cin>>w>>t>>l;
max=w;
flag='W';
if(t>max){
max=t;
flag='T';
}
if(l>max){
max=l;
flag='L';
}
sum*=max;
cout<<flag<<" ";
}
double res=(sum*0.65-1)*2;
printf("%.2f",res);
return 0;
}
别的优秀解法:
看作一个二维数组来处理
#include <iostream>
#include <cstdio>
int main() {
double res = 0.65;
char symbol[] = {'W', 'T', 'L'};
for(int i = 0; i < 3; i++){
int maxJ = -1;
double t, maxN = -1.;
for(int j = 0; j < 3; j++){
scanf("%lf", &t);
if(t > maxN){
maxN = t;
maxJ = j;
}
}
res *= maxN;
printf("%c ", symbol[maxJ]);
}
printf("%.2lf", (res - 1.) * 2.);
return 0;
}