比较水的一道题

求胜率和钱数

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`

## 实现思想

每行输入三个数，对三个数进行比较

记录下最大的数和对应的下标

计算最大数相乘并根据公式算出钱数

根据前面记录的下标从数组中输出对应的字符

## 代码实现

```
#include <iostream>
using namespace std;
int main() {
double max_odd = 1.0, odd, temp = 0.0;
int index[3];
char arr[3] = {'W', 'T', 'L'};
for(int i = 0; i < 3; i++) {
temp = 0;
for(int j = 0; j < 3; j++) {
scanf("%lf", &odd);
if(odd >= temp){
index[i] = j;
temp = odd;
}
}
max_odd *= temp;
}
double result = (max_odd * 0.65 - 1)*2;
for(int k = 0; k < 3; k++) {
printf("%c ", arr[index[k]]);
}
printf("%.2f", result);
return 0;
}
```

**本文链接：**https://blog.zjgsujz.cn/2020/07/20/pat-advanced-1011/**版权声明：**本博客所有文章除特别声明外，均默认采用 许可协议。