PAT 甲级 1011 World Cup Betting-CSDN博客

本文探讨了2010年世界杯期间球迷如何利用中国体育彩票的‘Triple Winning’游戏进行投注，通过计算最优组合和最大赢利，揭示了如何利用赔率规则实现39.31元的最大收益。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

【PAT甲级】 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
！结尾无空行

思路

题目要求

给定三组数，打印最佳赌注和最大利润。

题目分析

我们总习惯性得将数据类型写成int，但是根据示例就可以看出不是int型。
最大利润需要精确到小数点后2位。
字符与数字必须用一个空格分割，打印时需要注意。

参考代码如下

    #include<iostream>
    #include<algorithm>
    #include<iomanip>
    using namespace std;
    
    double input[3][3];
    
    int max(double *n){
      double *m=max_element(n,n+3);
      return m-n;
    }
    
    int main(){
      for(int i=0;i<3;i++){ //输入
      	for(int j=0;j<3;j++){
      	cin>>input[i][j];
      	}
      }
      double sum=1;
      for(int i=0;i!=3;++i){//判断W、T、L
    	int n=max(input[i]);
    	if(n==0)
      		cout<<"W";
    	else if(n==1)
      		cout<<"T";
    	else
      		cout<<"L";
    	cout<<" ";
    	sum *=input[i][n];
      }
      sum *= 0.65;
      sum = (sum-1)*2;
      cout<<fixed<<setprecision(2)<<sum;  
      return 0;
    }