1011. World Cup Betting (20)-PAT甲级真题

最新推荐文章于 2025-11-21 15:39:05 发布

原创最新推荐文章于 2025-11-21 15:39:05 发布 · 262 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#c++ #编程语言 #字符串

甲级真题PAT (Advanced Level) Practice 专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一种在中国足球彩票“TripleWinning”游戏中获取最大利润的投注策略，通过分析三场比赛的胜负平赔率，找出每场最高赔率并计算投注2元时的最大收益。

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>
#include<bits/stdc++.h>
using namespace std;
int main() {
    float f[3][3], max[3][2] = { 0 }, win;
    string str[4] = { "W","T","L" };
    for (int i = 0; i < 3; i++) {
        for (int j = 0; j < 3; j++) {
            cin >> f[i][j];
            if (max[i][0] < f[i][j]) {
                max[i][0] = f[i][j];
                max[i][1] = j;
            }
        }
    }
    win = (max[0][0] * max[1][0] * max[2][0] * 0.65 - 1) * 2;
    cout << str[(int)max[0][1]] << " " << str[(int)max[1][1]] << " " << str[(int)max[2][1]] << " ";
    printf("%.2f", win);
    return 0;
}