[LightOJ 1265] Island of Survival

最新推荐文章于 2021-05-10 22:54:21 发布

转载最新推荐文章于 2021-05-10 22:54:21 发布 · 81 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/whc200305/p/7206023.html

在孤岛上，面对有限数量的老虎和鹿，人类如何通过策略提高生存几率？本文解析了一个基于动物相遇规则的生存游戏，探讨了数学概率与决策的重要性。

Island of Survival

You are in a reality show, and the show is way too real that they threw into an island. Only two kinds of animals are in the island, the tigers and the deer. Though unfortunate but the truth is that, each day exactly two animals meet each other. So, the outcomes are one of the following

a) If you and a tiger meet, the tiger will surely kill you.

b) If a tiger and a deer meet, the tiger will eat the deer.

c) If two deer meet, nothing happens.

d) If you meet a deer, you may or may not kill the deer (depends on you).

e) If two tigers meet, they will fight each other till death. So, both will be killed.

If in some day you are sure that you will not be killed, you leave the island immediately and thus win the reality show. And you can assume that two animals in each day are chosen uniformly at random from the set of living creatures in the island (including you).

Now you want to find the expected probability of you winning the game. Since in outcome (d), you can make your own decision, you want to maximize the probability.

Input

Input starts with an integer T (≤ 200), denoting the number of test cases.

Each case starts with a line containing two integers t (0 ≤ t ≤ 1000) and d (0 ≤ d ≤ 1000) where tdenotes the number of tigers and d denotes the number of deer.

Output

For each case, print the case number and the expected probability. Errors less than 10^-6 will be ignored.

Sample Input

0 0

1 7

2 0

0 10

Sample Output

Case 1: 1

Case 2: 0

Case 3: 0.3333333333

Case 4: 1

题目大意:孤岛上有T只老虎,D只鹿,1个人(你).每天会有两种动物相遇,其中:

1.老虎和人相遇,人必败;

2.老虎和鹿相遇,鹿必败;

3.老虎和老虎相遇,双方都得死;

4.鹿和鹿相遇,什么也不发生;

5.人和鹿相遇,人必定不败,鹿未必;

最后让你求人活下来的概率.

我们会发现这样一个事实,人的威胁就是老虎.所以,如果到最后,还有老虎没死,那么人必死.

所以如果有奇数只老虎,人必败,输出0;若没有老虎,显然人肯定能存活,输出1;

主要是关注,有2k只老虎(k>0)时,人的存活情况.显然,人存活的情况,那2k只老虎都成对死亡.

由于我们可以直接忽略鹿的存在(不影响结果),所以在第一天,选取两只动物总共的方案数为(2k+1)2k,其中,没有人的方案数为2k(2k-1),则第一天,人存活的概率为后者除以前者,也就是(2k-1)/(2k+1).

由于最多总共有k天,则第i(1<i<=k)天时,人依然存活的概率是第i-1天的概率乘以(2(k-i+1)-1)/(2(k-i+1)+1).最后输出就好了.

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<algorithm>
 4 #include<cmath>
 5 using namespace std;
 6 int T,D;
 7 int main(){
 8     int Tt; scanf("%d",&Tt);
 9     for (int Ts=1; Ts<=Tt; Ts++){
10         scanf("%d%d",&T,&D);
11         double ans=1;
12         if (T==0) ans=1; else
13         if (T&1) ans=0; else
14         for (;T>0; T-=2) ans*=(double)(T-1)/(double)(T+1);
15         printf("Case %d: %.10lf\n",Ts,ans);
16     }
17     return 0;
18 }

View Code

转载于:https://www.cnblogs.com/whc200305/p/7206023.html