lightOJ - 1265（概率与期望）

题目：LightOJ - 1265 

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 t denotes 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

4

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个人。枚举随机抽取两只动物（包括人）碰面。如果鹿遇鹿则无事；如果鹿遇虎，则鹿死；如果虎遇虎，则都死；如果人遇鹿，则鹿可能死也可能不死；如果人遇虎，则人死。问人生存的概率是多少？ 

分析：鹿和人的生死无关，因此忽略；

虎的数量是奇数时，人必死；

虎的数量是偶数时，只要每次都是两只虎出来人就可以活下来；

因此answer = C(2)(t) / C(2)(t + 1) * C(2)(t - 2) / C(2)(t - 1) * C(2)(t - 4) /C(2)(t - 3) ·····1 / C(2)(3);

 = (t - 1) / (t + 1) * (t - 3) / (t - 1) * (t - 5) / (t - 3) ······1 / 3;

化简得 answer = 1.0 / (t + 1);

#include <iostream>
#include <stdio.h>
using namespace std;

int main()
{
    int T,t,d;
    cin >> T;
    int Case = 0;
    while(T --)
    {
        cin >> t >> d;
        if(t % 2)printf("Case %d: 0\n",++ Case);
        else printf("Case %d: %.10lf\n",++ Case,1.0 / (t + 1));
    }
    return 0;
}