专栏首页Don的成长史【PAT甲级】World Cup Betting

【PAT甲级】World Cup Betting

版权声明:本文为博主原创文章,遵循 CC 4.0 BY-SA 版权协议,转载请附上原文出处链接和本声明。

本文链接:https://blog.csdn.net/weixin_42449444/article/details/89714801

Problem Description:

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

解题思路:

这是一道水题啊,甲级里面真的没有比这题更简单的啦。设最大利润为sum,利用max()来无脑找出胜负平的最高赔率ans,然后输出三局比赛最高赔率对应的彩果以及最大利润sum即可。

AC代码:

#include <bits/stdc++.h>
using namespace std;

int main()
{
    double sum = 1;   //最大利润sum
    for(int i = 0; i < 3; i++)
    {
        double W,T,L;   //胜W,平T,负L的赔率
        cin >> W >> T >> L;
        double ans = max(max(W,T),L);   //取最高赔率
        if(ans == W)
        {
            cout << "W ";
        }
        else if(ans == T)
        {
            cout << "T ";
        }
        else
        {
            cout << "L ";
        }
        sum *= ans;
    }
    sum = (sum*0.65-1)*2;
    printf("%.2f\n",sum);
    return 0;
}

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

我来说两句

0 条评论
登录 后参与评论

相关文章

  • 【PAT甲级】Sign In and Sign Out

    版权声明:本文为博主原创文章,遵循 CC 4.0 BY-SA 版权协议,转载请附上原文出处链接和本声明。 ...

    喜欢ctrl的cxk
  • 【Codeforces】1216B - Shooting

    版权声明:本文为博主原创文章,遵循 CC 4.0 BY-SA 版权协议,转载请附上原文出处链接和本声明。 ...

    喜欢ctrl的cxk
  • 【Codeforces】1217A - Creating a Character

    版权声明:本文为博主原创文章,遵循 CC 4.0 BY-SA 版权协议,转载请附上原文出处链接和本声明。 ...

    喜欢ctrl的cxk
  • PAT 1011 World Cup Betting (20分) 比较大小难度级别

    With the 2010 FIFA World Cup running, football fans the world over were becoming...

    vivi
  • 一种新的高光谱卫星图像分类空间光谱框架(CS)

    高光谱卫星图像目前被广泛用于准确的灾害预测和地形特征分类。然而,在这样的分类任务中,目前的大多数方法只使用到图像中包含的光谱信息。 因此,在本文中,我们提出了一...

    太子钟
  • linux kernel Documentation filesystems overlayfs

    Please see MAINTAINERS file for where to send questions.

    heidsoft
  • 语义分割--Global Deconvolutional Networks for Semantic Segmentation

    语义分割 Global Deconvolutional Networks for Semantic Segmentation BMVC 2016 ...

    用户1148525
  • IBM刀片服务器管理模块恢复出厂默认值实战

    Resetting the management module back to factory defaults

    力哥聊运维与云计算
  • Redis 为什么这么快?(9)

    因为单线程已经够用了,CPU不是redis的瓶颈。Redis的瓶颈最有可能是机器内存或者网络带宽。既然单线程容易实现,而且CPU不会成为瓶颈,那就顺理成章地采用...

    兜兜毛毛
  • POJ-1644 To Bet or Not To Bet(概率DP)

    To Bet or Not To Bet Time Limit: 1000MS Memory Limit: 10000K Total Subm...

    ShenduCC

扫码关注云+社区

领取腾讯云代金券