zoukankan      html  css  js  c++  java
  • PAT (Advanced Level) Practice 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 ( 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

    思路:每轮找出最大值的索引,然后再根据索引和公式计算,最后输出。
     1 #include <stdio.h>
     2 double a[3][3];
     3 int main()
     4 {
     5     char b[3]={'W','T','L'};
     6     int c[3];
     7     double maxa=0;
     8     for(int i=0;i<3;i++){
     9         maxa=0;
    10         for(int j=0;j<3;j++){
    11             scanf("%lf",&a[i][j]);
    12             if(a[i][j]>maxa){
    13                 maxa=a[i][j];
    14                 c[i]=j;
    15             }
    16         }
    17     }
    18     double sum=1;
    19     for(int i=0;i<3;i++){
    20         sum*=a[i][c[i]];
    21     }
    22     sum=sum*0.65-1;
    23     sum*=2;
    24     printf("%c %c %c %.2f
    ",b[c[0]],b[c[1]],b[c[2]],sum);
    25     return 0;
    26 }
  • 相关阅读:
    mpstat命令学习
    vmstat命令学习
    Oracle数据库坏块的恢复
    Oracle数据库字符集试验
    记一次windows下物理迁移数据库的过程
    NeoKylin5.6下安装部署达梦(DM7)数据库
    使用BBED模拟Oracle数据库坏块
    centos7之zabbix的监控H3C ER3200G2流量
    centos7之zabbix3.2的fping监控
    centos7之zabbix3.2搭建
  • 原文地址:https://www.cnblogs.com/wydxry/p/11053104.html
Copyright © 2011-2022 走看看