• 1011 World Cup Betting


    1011 World Cup Betting

    0、题目

    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
    
    • 1
    • 2
    • 3
    • 4

    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
    
    • 1
    • 2
    • 3

    Sample Output:

    T T W 39.31
    
    • 1

    1、大致题意

    就是有3场比赛,每一场从W、T、L选一个值,使得 ( a ∗ b ∗ c ∗ 0.65 − 1 ) ∗ 2 (a*b*c*0.65-1)*2 (abc0.651)2最大。

    2、基本思路

    简单题

    3、AC代码

    #include
    #include
    #include
    using namespace std;
    double w,t,l,ans,tmp;
    
    int main(){
    	ans=1;
    	for(int i=0;i<3;i++){
    		scanf("%lf%lf%lf",&w,&t,&l);
    		if(w>=t&&w>=l){
    			cout<<"W"<<" ";
    			tmp=w;
    		}else if(t>=w&&t>=l){
    			cout<<"T"<<" ";
    			tmp=t;
    		}else{
    			cout<<"L"<<" ";
    			tmp=l;
    		}
    		ans*=tmp;
    	}
    	ans=2*(ans*0.65-1);
    	cout<<setiosflags(ios::fixed)<<setprecision(2)<<ans;
    	return 0;
    }
    
    • 1
    • 2
    • 3
    • 4
    • 5
    • 6
    • 7
    • 8
    • 9
    • 10
    • 11
    • 12
    • 13
    • 14
    • 15
    • 16
    • 17
    • 18
    • 19
    • 20
    • 21
    • 22
    • 23
    • 24
    • 25
    • 26
  • 相关阅读:
    写一篇nginx配置指南
    Ef Core花里胡哨系列(7) 使用Ef Core也能维护表架构?
    AI技术产业热点分析
    Socket编程实现简易聊天室
    HTML CSS个人网页设计与实现——人物介绍丁真(学生个人网站作业设计)
    python xlrd+xlwt+xlutils处理excel
    【S1005基于bs架构的自行车在线租赁管理系统-哔哩哔哩】 https://b23.tv/WJJFGAh
    聊聊 HTMX 吧
    跳闸、合闸位置监视继电器HJTHW-E002J/DC220V
    双线性插值算法原理讲解及计算示例
  • 原文地址:https://blog.csdn.net/qq_46371399/article/details/126358996