pat 1011
来源:互联网 发布:淘宝网店推广策划书 编辑:程序博客网 时间:2024/05/06 11:20
1011. World Cup Betting (20)
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 Input1.1 2.5 1.71.2 3.0 1.64.1 1.2 1.1Sample Output
T T W 37.98
好水的题啊。
#include <stdio.h>double games[4][4];int main(){int i, j;double max, sum;int index;char map[4];for(i = 1, sum = 1; i <= 3; i++){max = -1;index = -1;for(j = 1; j <= 3; j++){scanf("%lf", &games[i][j]);if(games[i][j] > max){max = games[i][j];index = j;}}sum *= max;if(index == 1) map[i] = 'W';else if(index == 2) map[i] = 'T';else if(index == 3) map[i] = 'L';}sum = (sum * 0.65 - 1) * 2;printf("%c %c %c %.2lf\n", map[1], map[2], map[3], sum);return 0;}
- pat---1011
- pat 1011
- PAT 1011
- PAT 1011
- pat 1011
- pat 1011
- PAT 1011
- PAT 1011
- PAT 1011
- PAT 1011
- PAT 1011
- PAT 1011
- PAT 1011
- PAT-1011
- PAT 1011-1020 题解
- pat: 1011 long long
- PAT (Basic) 1011~1015
- PAT(A) 1011
- Google三大技术论文MapReduce/GFS/BigTable
- 科幻大片中那些牛X代码真相
- 邮箱邮件
- linux命令系列之man
- 昨晚接到的电话面试
- pat 1011
- 一步步学习SPD2010--第六章节--处理数据源(4)--连接RSS Feed服务器端脚本
- 【ZJOI2009】狼和羊的故事
- 算法训练-卡片游戏
- 安装ANDROID ADT的duplicate location错误
- LoadLibrary函数
- android遇上地图
- Spring-Struts2的结果集
- 总结Oracle的五个Windows服务