• 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:

    1.  W    T    L
    2. 1.1  2.5  1.7
    3. 1.2  3.1  1.6
    4. 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.1 2.5 1.7
    2. 1.2 3.1 1.6
    3. 4.1 1.2 1.1

    Sample Output:

    T T W 39.31

    题目大意

    有三场⽐赛,三行给出每场⽐赛的W、T、L的赔率。我们要选取每⼀场⽐赛中赔率最⼤的三个数a b c，先输出三⾏各⾃选择的是W、T、L中的哪⼀个，然后根据计算公式 (a * b * c * 0.65 – 1) * 2 输出最大收益

    思路

    由题目大意可得

    C/C++ 

    1. #include
    2. using namespace std;
    3. double Max(double W,double T,double L){
    4.     if(W >= T && W >= L){
    5.         cout << "W" << " ";
    6.         return W;
    7.     }
    8.     if(T>=W && T>=L){
    9.         cout << "T" << " ";
    10.         return T;
    11.     }
    12.     cout << "L" << " ";
    13.     return L;
    14. }
    15. int main()
    16. {
    17.     double a,b,c,result=1;
    18.     for(int z=0;z<3;z++){
    19.         cin >> a >> b >> c;
    20.         result *=  Max(a,b,c);
    21.     }
    22.     result = (result*0.65-1) * 2;
    23.     printf("%.2f",result);
    24.     return 0;
    25. }

  • 相关阅读:
    vue2 数据响应式原理——数据劫持（对象篇）
    PMP-项目风险管理的重要性
    docker开发环境搭建(windows)
    HTML表格合并行和列
    leetcode经典面试150题---2.移除元素
    Greek Alphabet Letters & Symbols
    Keras深度学习实战（32）——基于LSTM预测股价
    Python基础 P6函数
    LeetCode每日一题(2212. Maximum Points in an Archery Competition)
    C#中事务的操作
  • 原文地址：https://blog.csdn.net/daybreak_alonely/article/details/127639995