zoukankan      html  css  js  c++  java
  • 1011 World Cup Betting (20 分)

    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 ( 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 WT 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<bits/stdc++.h>
    using namespace std;
    const int maxn=10010;
    struct bet{
        double num[maxn];
    };
    int main(){
        bet B;
        double sum=1;
        string s="WTL";
        string st;
        for(int i=0;i<3;i++){
            double maxOdd=0;
            int ins=-1;
            for(int j=0;j<3;j++){
                scanf("%lf",&B.num[j]);
                if(B.num[j]>maxOdd){
                    maxOdd=B.num[j];
                    ins=j;
                }
            }
                sum*=maxOdd;
                st+=s[ins];
        }
        for(int i=0;i<st.size();i++){
            cout<<st[i]<<" ";
        }
        printf("%.2f
    ",(sum*0.65-1)*2);
        return 0;
    }
  • 相关阅读:
    SQL一条语句统计记录总数及各状态数
    火狐登录国际账户
    HTML基础笔记
    增强for、lambda for、stream 遍历List 结束方法 or 跳过循环本次循环
    nginx
    前端问题总结
    Node.js
    Actuator
    ssh免密登录实现及Python实现
    【Mac渗透测试】之SQL注入Demo
  • 原文地址:https://www.cnblogs.com/dreamzj/p/14909051.html
Copyright © 2011-2022 走看看