• 1011 World Cup Betting


    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 res=1;
        int n=3;
        while(n--){
            double a,b,c;
            cin>>a>>b>>c;
            if(a>b&&a>c){
                res*=a;
                cout<<"W";
            }
                
            else if(b>a&&b>c){
                res*=b;
                cout<<"T";
            }
                
            else{
                res*=c;
                cout<<"L";
            }
            cout<<" ";
        }
        double ans=(res*0.65-1)*2;
        printf("%.2lf",ans);
        return 0;
    }
    
    • 1
    • 2
    • 3
    • 4
    • 5
    • 6
    • 7
    • 8
    • 9
    • 10
    • 11
    • 12
    • 13
    • 14
    • 15
    • 16
    • 17
    • 18
    • 19
    • 20
    • 21
    • 22
    • 23
    • 24
    • 25
    • 26
    • 27
    • 28
    • 29
  • 相关阅读:
    【ARMv8/ARMv9 硬件加速系列 3.5 -- SVE 谓词寄存器Pg修改详细介绍】
    VS2019创建动态库,包含普通函数,类,C语言函数
    对于程序员什么最重要
    全栈----跨域
    怎么保护香港物理服务器?(常见应对方式)
    自建云服务计费系统
    NetApp与VMware和AWS合作,帮助客户实现云端企业工作负载的现代化和扩展
    人脸识别4-百度商用方案调研
    react 入门
    Windows安装多Java版本快速切换
  • 原文地址:https://blog.csdn.net/weixin_49047177/article/details/125498042