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

    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 (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
    
     
     1 #include <map>
     2 #include <set>
     3 #include <queue>
     4 #include <cmath>
     5 #include <stack>
     6 #include <vector>
     7 #include <string>
     8 #include <cstdio>
     9 #include <cstring>
    10 #include <climits>
    11 #include <iostream>
    12 #include <algorithm>
    13 #define wzf ((1 + sqrt(5.0)) / 2.0)
    14 #define INF 0x3f3f3f3f
    15 #define LL long long
    16 using namespace std;
    17 
    18 const int MAXN = 10;
    19 
    20 double A[MAXN], B[MAXN], C[MAXN], ans = 0.65;
    21 
    22 char c[MAXN];
    23 
    24 int main()
    25 {
    26     for (int i = 0; i < 3; ++ i)
    27     {
    28         scanf("%lf%lf%lf", &A[i], &B[i], &C[i]);
    29         if (A[i] >= B[i] && A[i] >= C[i])
    30         {
    31             c[i] = 'W';
    32             ans *= A[i];
    33         }
    34         else if (B[i] >= A[i] && B[i] >= C[i])
    35         {
    36             c[i] = 'T';
    37             ans *= B[i];
    38         }
    39         else
    40         {
    41             c[i] = 'L';
    42             ans *= C[i];
    43         }
    44 
    45     }
    46     printf("%c %c %c %.2lf
    ", c[0], c[1], c[2], (ans - 1) * 2);
    47     return 0;
    48 }
  • 相关阅读:
    谈谈程序员、技术主管和架构师
    PyPI教程
    python以下划线开头的变量和函数的作用
    csv和xlsx区别
    编码问题2 utf-8和Unicode的区别
    编码问题1
    洛谷 1404 平均数
    洛谷 1441 砝码秤重
    【模板】高斯消元法
    线段树练习题
  • 原文地址:https://www.cnblogs.com/GetcharZp/p/9577742.html
Copyright © 2011-2022 走看看