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

    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 package pattest;
     2 
     3 import java.util.Scanner;
     4 
     5 /**
     6  * @Auther: Xingzheng Wang
     7  * @Date: 2019/2/19 19:54
     8  * @Description: pattest
     9  * @Version: 1.0
    10  */
    11 public class PAT1011 {
    12     public static void main(String[] args) {
    13         char[] ch = {'W', 'T', 'L'};
    14         double mul = 1.0;
    15         Scanner sc = new Scanner(System.in);
    16         for (int i = 0; i < 3; i++) {
    17             double max = 0.0;
    18             int n = 0;
    19             for (int j = 0; j < 3; j++) {
    20                 double t = sc.nextDouble();
    21                 if (t > max) {
    22                     max = t;
    23                     n = j;
    24                 }
    25             }
    26             System.out.print(ch[n] + " ");
    27             mul += max;
    28         }
    29         System.out.println(String.format("%.2f", (mul * 0.65 - 1) * 2));
    30     }
    31 }
  • 相关阅读:
    tfs+git
    fis3 部署手册
    git +vs2017 操作手册+目前工作流程图
    Git 分支策略
    git 分回滚后无法合并代码问题
    git 拉取远程分支到本地并建立关联关系
    mysql查看数据库大小或者表大小
    centos7.4安装高可用(haproxy+keepalived实现)kubernetes1.6.0集群(开启TLS认证)
    centos7.4安装kubernetes1.6.0(开启TLS认证)
    Centos搭建http代理服务器(无密码验证)
  • 原文地址:https://www.cnblogs.com/PureJava/p/10497978.html
Copyright © 2011-2022 走看看