|
||||||||||
Marble MadnessTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 663 Accepted Submission(s): 402 Special Judge Problem Description oyvind likes to test his future employees, especially with funny games. This time he has invented a game where you start out with B black marbles and W white ones in a bag. You also have endless supplies of both kinds of marbles outside the bag. The game proceeds in rounds. In each round, you take two marbles at random out of the bag, and put one marble back in (possibly another color than any of the two you took out), obeying the following rules: 1. When you take out two white marbles, you put a black one back in. 2. When you take out one black and one white, you put a white marble back in. 3. When you take out two black marbles, you put a black one back in. At the end of this game, there will only be one marble in the bag. This marble may be white with a probability and black with a probability given the number of marbles of each colour you start with. Your job is to find these probabilities. Input The input will start with a line giving the number of test cases, T. Each test case will be presented at one line with two integers, B and W, separated by a single space, representing the number of black and white marbles respectively. Output There should be one line of output for each test case with two floating point numbers separated by a single space. The first number should represent the probability that the last marble is black, and the second the probability that the last marble is white. Notes and Constraints 0 < T <= 100 0 <= B,W <= 50000 0 < B +W Any answer within 10^-6 of the correct one will be accepted. Sample Input
Sample Output
Source | ||||||||||
|