Liang Guo Sha

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 527 Accepted Submission(s): 367

Problem Description

Maybe you know “San Guo Sha”, but I guess you didn’t hear the game: “Liang Guo Sha”!

Let me introduce this game to you. Unlike “San Guo Sha” with its complicated rules, “Liang Guo Sha” is a simple game, it consists only four cards, two cards named “Sha”, and the other named “Shan”.

Alice and Bob are good friends, and they’re playing “Liang Guo Sha” now. Everyone has two cards: a “Sha” and a “Shan”. Each round, everyone choose a card of his/her own, and show it together(Just show the selected card, do not need to put it away). If both of them choose “Sha”, then Alice gets A points, and Bob loses A points; if both of them choose “Shan”, then Alice gets B points, and Bob loses B points; otherwise, Bob gets C points, and Alice loses C points.

Both Alice and Bob wants to get points as many as possible, they thought a optimal strategy: Calculating a percentage of choosing card “Sha” in order to ensure that even the opponent uses the optimal strategy, he/she can still get a highest point exceptation.

Here is the question, if both Alice and Bob use the optimal strategy to make their points higher, what is the expectation point which Alice can get in a round?

Input

Several test case, process to EOF.
Each test case has only a line, consists three positive integers: A, B, C respectively.
1 <= A, B, C <= 100000

Output

Each test case just need to output one line, the expectation point that Alice can get. Round to 6 decimal points.

Sample Input

2 10 4 3 3 3

Sample Output

0.200000 0.000000

Hint

In test case 1, both Alice and Bob calculated the best percentage of choosing “Sha”, and the their percentage are the same: 70%. If Bob do not choose the best percentage, his strategy might be targetd.For example, if Bob choose 100%, then Alice can change her percentage to 100%, Bob might lose many points. Bob is clever, so he won’t do that.

Source

2011 Multi-University Training Contest 8 - Host by HUST

题目大意：

If both of them choose “Sha”, then Alice gets A points, and Bob loses A points; if both of them choose “Shan”, then Alice gets B points, and Bob loses B points; otherwise, Bob gets C points, and Alice loses C points.

给定A B C的值，求Alice得分的数学期望，已知Alice的数学期望与Bob无关。

解题思路：

假设Alice出杀的概率为pa,Bob出杀的概率为pb

则Alice得分的数学期望EX(Alice)=a*pa*pb+b*(1-pa)*(1-pb)-c*pa*(1-pb)-c*(1-pa)*pb;

整理得 EX(Alice)=pb*(a*pa+b*pa-b-c+2*c*pa)+b-b*pa-c*pa;

既然Alice的数学期望与Bob无关，那么pb的系数为0，则(a*pa+b*pa-b-c+2*c*pa)=0，

解得，pa=(b+c)/(a+2*c+b);

带入原方程求解得到答案

代码：

#include <iostream>
#include <cstdio>
using namespace std;int main(){double a,b,c;while(cin>>a>>b>>c){double pa=(b+c)/(a+2*c+b);double ans=b-b*pa-c*pa;printf("%.6lf\n",ans);}return 0;
}

HDU 3910 Liang Guo Sha相关推荐

hdu3910 Liang Guo Sha（期望）
思路:将Alice的期望写出来化简之后有E(x)=(pa*(a+b+2c)-b-c)pb-b*pa-c*pa+b 因为Alice与B是否出杀无关,即第一项pb那里的系数为0,所以可以推导出pa*(a+ ...
【C#公共帮助类】10年代码，最全的系统帮助类
这个帮助类主要包含:对象转换处理 .分割字符串.截取字符串.删除最后结尾的一个逗号. 删除最后结尾的指定字符后的字符. 生成指定长度的字符串. 生成日期随机码. 生成随机字母或数.字截取字符长度. ...
汉字转拼音，一二级词库，不支持多音字
GB2312标准共收录6763个汉字,其中一级汉字3755个,二级汉字3008个. 分区表示 GB 2312中对所收汉字进行了"分区"处理,每区含有94个汉字/符号.这种表示方式 ...
今天收到一封MAIL，是转发了N次转发过来的，标题就叫 FW 听说是真有此事，内容如下（我是不信的，至于你怎么
今天收到一封MAIL,是转发了N次转发过来的,标题就叫"FW: ^_^听说是真有此事",内容如下(我是不信的,至于你怎么看,就看你的行动了.不过,真的有趣,让我想起了以前的关于将I ...
完整的系统帮助类Utils
//来源:http://www.cnblogs.com/yuangang/p/5477324.html using System; using System.Collections.Generic; ...
C#实现汉字转全拼与简拼
功能描述: 1.将字符串转换为全拼表示 2.将字符串转换为全拼表示,汉字拼音之间空格分隔 3.将字符串转换为全拼表示,汉字拼音之间的分隔符可以指定 ...
汉字转全拼,简拼组件
这几天研究了一下如何获取汉字拼音.在网上找了一些资料.也了解了一些有关汉字编码的新概念(对本人来讲的新概念). 比如:机内码,ASCII码等在搜索的过程中,发现几乎所 ...
C#下汉字转换成拼音
因为一个开发需求需要把汉字转换成拼音,没想到还真的可以! 找了一个类,是别人整理的,默认情况下第一个字母是大写的.我这边需要都是小写的,可以按照自己情况进行实际的需求进行修改,比如有些时候只要首字母就 ...
GB2312-80 所有汉字排序,拼音
须知:所有这些汉字都是GB2312-80标准中说明的汉字. 下面的这些规则不一定适用其它标准中的汉字范围. // 各声母的汉字界限. 这是经过将GB2312-80标准中的所有汉字排序后,获取拼音后提取 ...

HDU 3910 Liang Guo Sha

Liang Guo Sha

HDU 3910 Liang Guo Sha相关推荐

最新文章

热门文章