• A1011. World Cup Betting


    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.0  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.0*2.5*65%-1)*2 = 37.98 yuans (accurate up to 2 decimal places).

    Input

    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

    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.0 1.6
    4.1 1.2 1.1
    

    Sample Output

    T T W 37.98

     1 #include<cstdio>
     2 #include<iostream>
     3 #include<algorithm>
     4 using namespace std;
     5 int main(){
     6     int games[3];
     7     double odds[3], p, maxp, ans;
     8     char name[3] = {'W', 'T', 'L'};
     9     for(int i = 0; i < 3; i++){
    10         maxp = -99999;
    11         for(int j = 0; j < 3; j++){
    12             scanf("%lf", &p);
    13             if(p > maxp){
    14                 maxp = p;
    15                 odds[i] = p;
    16                 games[i] = j;
    17             }
    18         }
    19     }
    20     ans = (odds[0] * odds[1] * odds[2] * 0.65 - 1.0) * 2.0 + 0.0005;
    21     printf("%c %c %c %.2lf", name[games[0]], name[games[1]], name[games[2]], ans);
    22     cin >> p;
    23     return 0;
    24 }
    View Code

    总结:

    1、可以使用数组{'W,'T','L'}来记录结果。

    2、四舍五入,可以加一个极小的数。

    3、可以边输入边处理。

  • 相关阅读:
    javascript学习笔记1
    html的那些小小细节
    高级排序之希尔排序
    归并排序
    java 块语句 和引用类型
    扩展思维
    javase jdk 环境变量 涵义
    java 冒泡排序 二分查找 选择排序 插入排序
    kafka原理
    java web 程序---注册页面密码验证
  • 原文地址:https://www.cnblogs.com/zhuqiwei-blog/p/8432711.html
Copyright © 2020-2023  润新知