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 }
  • 相关阅读:
    Java硬件同步机制Swap指令模拟+记录型信号量模拟
    算法(第四版)练习 1.1.26 ~ 1.1.31
    C++ 电路布线/最短路径问题
    线性代数笔记
    算法导论(第三版)练习 2.2-1 ~ 2.2-4
    条款45: 弄清C++在幕后为你所写、所调用的函数
    条款42: 明智地使用私有继承
    条款41: 区分继承和模板
    【python】字符遍历
    【python】range的用法
  • 原文地址:https://www.cnblogs.com/PureJava/p/10497978.html
Copyright © 2011-2022 走看看