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<iostream>
    #include<algorithm>
    #include<cstdio>
    #include<cstring>
    #include<string.h>
    #include<cstdlib>
    using namespace std;
    #define mm 1e-8
    const int maxn=110;
    char cc[3];
    double Max(double a,double b,double c,int i)
    {
        double m=0;
        if(a>b){
            m=a;
            cc[i]='W';
        }
        if(b>a){
            m=b;
            cc[i]='T';
        }
        if(c>m){
            m=c;
            cc[i]='L';
        }
        return m;
    }
    int main(){
        double a,b,c;
        double m[3];
        for(int i=0;i<3;i++){
            scanf("%lf %lf %lf",&a,&b,&c);
            m[i]=Max(a,b,c,i);
            
        }
        printf("%c %c %c %.2f
    ",cc[0],cc[1],cc[2],(m[0]*m[1]*m[2]*0.65-1)*2);
        return 0;
    } 
  • 相关阅读:
    【Thymeleaf】利用status对象在th:each语法中显示index
    【Oracle】使用Regexp_like 判断varchar2,nvarchar2型字段里中值是否全由数字组成
    [轉]相機光圈
    選購數碼相機
    [轉載]找不到SQL server ODBC驱动程序的安装例程!请重新安装驱动程序
    [轉]解读GIF文件
    [轉]【经典问题】关于JS验证文本框输入只能输入半角,不让输入全角
    WebGenie
    XML和HTML常用转义字符
    PHP招聘启示
  • 原文地址:https://www.cnblogs.com/dreamzj/p/14274618.html
Copyright © 2011-2022 走看看