stone game (概率,递推)

最新推荐文章于 2024-04-18 23:25:48 发布

pennyshe

最新推荐文章于 2024-04-18 23:25:48 发布

阅读量495

点赞数

分类专栏： AC 文章标签： each output up input

本文链接：https://blog.csdn.net/pennyshe/article/details/5543714

版权

AC 专栏收录该内容

61 篇文章 0 订阅

订阅专栏

Stone Game

Time Limit:

1000MS

Memory Limit:

10000K

Description

Dennis and Joyce love to collect stones and play games with them. Up till now they have collected Na white stones and Nb black stones, and they are going to play a new game. The rules of the game is as follows:

(1) All the stones are put into a pocket initially, so that each stone has equal possibility to be picked up, and each time a stone is picked up randomly.

(2) The two players take turns to pick up a stone, if the stone is black, the current player should put it back to the pocket; otherwise the player could keep the stone.

(3) Whoever picks up the last white stone wins the game.

Now they haven’t decided who plays first. To make a better decision, Dennis have asked you, an excellent programmer, to calculate the winning possibility for the first player. Since they are going to start playing soon, you must finish the job as quickly as possible, Come on!

Input

The first line is a single number n, the number of test cases followed. In the next n lines, each line contains two non-negative integers, Na and Nb,(0≤Na, Nb≤64).

Output

For each test case, output a real number indicating the possibility for the first player to win. The answer should be rounded to 6 digits after the decimal point. No extra spaces are allowed.