1011. World Cup Betting (20)

来源:互联网 发布:广州java 外包公司 编辑:程序博客网 时间:2024/06/05 12:39

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    L1.1  2.5  1.71.2  3.0  1.64.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.71.2 3.0 1.64.1 1.2 1.1
Sample Output
T T W 37.98

这题没读题目,看了下答案还有中间一个 (4.1*3.0*2.5*65%-1)*2 = 37.98

感觉就是求每行最的最大值,并输出对应的字母,然后根据公式求出来最后的答案。

(这样做也就几分钟,如果错了,浪费几分钟也挺值)

就这样做了。过了

#include<iostream>#include<cstring>#include<cstdio>#include<queue>#include<stack>#include<algorithm>#include<cmath>using namespace std;int main(){float sum=1.0;char fz[4]={'W','T','L'};float a[3][3];for(int i=0;i<3;i++){for(int j=0;j<3;j++){cin>>a[i][j];}float max=a[i][0];for(int k=0;k<3;k++){if(a[i][k]>max){max=a[i][k];}}sum*=max;for(int k=0;k<3;k++){if(a[i][k]==max){cout<<fz[k]<<" ";break;}}}printf("%.2f",((sum*0.65)-1)*2);return 0;}



原创粉丝点击