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

     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 (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
    
    Sample Output:
    T T W 39.31
    
    思路
    • 简单来说题意就是:给定W,S,L的值,每次都找最大的(设为(x_n)),最后要求的就是:((x_1*x_2*...x_n*0.65-1)*2)
    代码
    #include<bits/stdc++.h>
    using namespace std;
    int get_max(int x, int y, int z)
    {
    	if(x >= y && x >= z)
    		return 1;
    	if(y >= x && y >= z)
    		return 2;
    	if(z >= x && z >= y)
    		return 3;
    }
    int main()
    {
    	double w,t,l;
    	double ans = 1.0;
    
    	int cond;
    	while(cin>>w>>t>>l)
    	{
    		cond = get_max(w,t,l);
    		switch(cond)
    		{
    			case 1: cout << "W "; ans *= w; break;
    			case 2: cout << "T "; ans *= t; break;
    			case 3: cout << "L "; ans *= l; break;
    		}
    	}
    	ans *= 0.65;
    	ans -= 1;
    	ans *= 2;
    	printf("%.2f
    ", ans);
    	return 0;
    }
    
    
    
    引用

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

  • 相关阅读:
    AtCoder Grand Contest 030题解
    Codeforces Round #542 (Div. 1) 题解
    ZJOI2019赛季回顾
    UOJ #450「集训队作业2018」复读机
    「IOI2018」狼人
    APIO2019游记
    BZOJ4314 倍数?倍数!
    伯努利数学习笔记&&Luogu P3711 仓鼠的数学题
    Codeforces Round #541 (Div. 2)题解
    UOJ #460 新年的拯救计划
  • 原文地址:https://www.cnblogs.com/MartinLwx/p/11664395.html
Copyright © 2011-2022 走看看