• PAT 甲级 1011 World Cup Betting


    https://pintia.cn/problem-sets/994805342720868352/problems/994805504927186944

    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 <bits/stdc++.h>
    using namespace std;
    
    struct Game{
        double w;
        double t;
        double l;
        double maxx;
        char res;
    }game[10010];
    
    int main() {
        for(int i = 1; i <= 3; i ++) {
            scanf("%lf%lf%lf", &game[i].w, &game[i].t, &game[i].l);
            game[i].maxx = max(max(game[i].w, game[i].t), game[i].l);
            if(game[i].maxx == game[i].w) game[i].res = 'W';
            else if(game[i].maxx == game[i].t) game[i].res = 'T';
            else game[i].res = 'L';
        }
    
        double money = 1;
        for(int i = 1; i <= 3; i ++) {
            money *= game[i].maxx;
        }
        money = (money * 0.65 - 1) * 2;
    
        for(int i = 1; i <= 3; i ++)
            printf("%c ", game[i].res);
        printf("%.2lf
    ", money);
    
        return 0;
    }
    

      

  • 相关阅读:
    复利计算(1)
    对IT行业的一些思考
    递归下降语义分析
    1118 实验三 有限自动机的构造与识别
    冒泡排序文法评论
    实验0:了解和熟悉操作系统
    0302思考IT行业的感想
    递归下降语义分析
    对文法解释和语法树的评论
    语言文法
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/9711472.html
Copyright © 2020-2023  润新知