• PAT 1011 World Cup Betting


    1011 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:

    1. W T L
    2. 1.1 2.5 1.7
    3. 1.2 3.1 1.6
    4. 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 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.1 2.5 1.7
    2. 1.2 3.1 1.6
    3. 4.1 1.2 1.1

    Sample Output:

    T T W 39.31

     总结:一开始还以为这道题目很难,结果仔细的看懂了题目就发现还是很简单的,只需要按题目意思一步一步来就行了

    代码:

    1. #include
    2. using namespace std;
    3. int main(){
    4. double sum=1,t;
    5. char c[3];
    6. char w[3]={'W','T','L'};
    7. for(int i=0;i<3;i++){
    8. double m=0;
    9. for(int j=0;j<3;j++){
    10. scanf("%lf",&t);
    11. if(m
    12. m=t;
    13. c[i]=w[j];
    14. }
    15. }
    16. sum=sum*m;
    17. }
    18. printf("%c %c %c",c[0],c[1],c[2]);
    19. printf(" %.2lf\n",(sum*0.65-1)*2);
    20. return 0;
    21. }

    依照惯例,看一眼大佬的代码

    1. #include
    2. using namespace std;
    3. int main() {
    4. char c[4] = {"WTL"};
    5. double ans = 1.0;
    6. for(int i = 0; i < 3; i++) {
    7. double maxvalue = 0.0;
    8. int maxchar = 0;
    9. for(int j = 0; j < 3; j++) {
    10. double temp;
    11. scanf("%lf", &temp);
    12. if(maxvalue <= temp) {
    13. maxvalue = temp;
    14. maxchar = j;
    15. }
    16. }
    17. ans *= maxvalue;
    18. printf("%c ", c[maxchar]);
    19. }
    20. printf("%.2f", (ans * 0.65 - 1) * 2);
    21. return 0;
    22. }

    好好学习,天天向上!

    我要考研

  • 相关阅读:
    word误删除的文件怎么恢复?恢复办法分享
    Spring Cloud 与dubbo微服务架构选型
    Springboot整合Elasticsearch
    RabbitMQ
    关于sklearn的:还可能是网络的问题???
    Android最近的行情到底怎么样了?还能好转吗?
    【MLT】MLT多媒体框架生产消费架构解析(二)
    一文搞懂系列之SpringMVC开发步骤及项目框架注册
    K8s:Pod初识
    论文研读|Protecting Intellectual Property of Deep Neural Networks with Watermarking
  • 原文地址:https://blog.csdn.net/weixin_50679551/article/details/126678961