1011. World Cup Betting (20)

原创 2016年05月31日 21:08:47

1011. World Cup Betting (20)

时间限制
400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue

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.0  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.0*2.5*65%-1)*2 = 37.98 yuans (accurate up to 2 decimal places).

Input

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

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.0 1.6
4.1 1.2 1.1
Sample Output
T T W 37.98

提交代

#include <iostream>
#include<cstdio>
#include<string.h>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
    double a[3][3]={0};
    int index[3]={0};
    double sum=1;
    for(int i=0;i<3;i++)
    for(int j=0;j<3;j++)
    cin>>a[i][j];
    for(int i=0;i<3;i++)
    {
    	int max=0;
    	for(int j=0;j<3;j++)
    	{
    		if(max<a[i][j])
    		{
    			max=a[i][j];
    			index[i]=j;///index[]记录的是第i行纵坐标值 
			}
		}
	}
	for(int i=0;i<3;i++)
	{
		if(index[i]==0)cout<<"W ";
		if(index[i]==1)cout<<"T ";
		if(index[i]==2)cout<<"L ";
	}
	for(int i=0;i<3;i++)
	sum*=a[i][index[i]];
	sum*=0.65;
	sum=(sum-1)*2;
	printf("%.2lf",sum);
    return 0;
}
就用了一个二维数组,so easy!

1011. World Cup Betting (20)

1011. World Cup Betting (20) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 1600...
  • fynjy
  • fynjy
  • 2015年07月07日 10:48
  • 211

PAT甲级.1011. World Cup Betting (20)

1011. World Cup Betting (20) 题目: With the 2010 FIFA World Cup running, football fans the world ove...

PAT A1011. World Cup Betting (20)

With the 2010 FIFA World Cup running, football fans the world over were becoming increasingly excite...
  • jolivan
  • jolivan
  • 2017年02月04日 22:07
  • 64

PAT 1011. World Cup Betting (20)(浮点数乘法)

题目1011. World Cup Betting (20)时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHE...

【PAT】1011. World Cup Betting (20)

题目:http://pat.zju.edu.cn/contests/pat-a-practise/1011 简单题。照着题目给出的公式计算就可以。 With the 2010 FIFA Worl...

PAT-PAT (Advanced Level) Practise 1011. World Cup Betting (20) (套公式) 【一星级】

题目链接:http://www.patest.cn/contests/pat-a-practise/1011 题面: 1011. World Cup Betting (20) ...

PAT-A 1011. World Cup Betting (20)

PAT-A 1011. World Cup Betting (20)

PAT甲级真题及训练集(7)--1011. World Cup Betting (20)

1011. World Cup Betting (20) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standa...

PAT A1011 World Cup Betting (20)

题目地址:https://www.patest.cn/contests/pat-a-practise/1011题目描述:With the 2010 FIFA World Cup running, fo...

1011. World Cup Betting (20)——PAT (Advanced Level) Practise

题目信息: 1011. World Cup Betting (20) 时间限制 400 ms 内存限制 32000 kB 代码长度限制 16000 B 判题程序 ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:1011. World Cup Betting (20)
举报原因:
原因补充:

(最多只允许输入30个字)