All Tracks Algorithms Dynamic Programming Introduction to Dynamic Programming 1 Problem

Win-the-Game
Tag(s):

Very-Easy

Problem
Editorial
Analytics

Kunal and Satyam are playing a game. A game is like this there is a bag consists of R red balls and G green balls.
Both player draw a ball alternatively and never put it back.The player draw the red balls will win the game. Satyam always start the game.If No one can draw the red ball then Satyam will win. Find the probability that Satyam will win the game.
Input:
The first line will contain the number of test cases T.
The first line of each test case will contain a number R (number of red balls) and G(number of green balls )

Output
For each testcase, print the desired probability.
Constraints:
1<=T<=10
0<=R,G<=10^3

Problem Setter : Surya Pratap Singh

SAMPLE INPUT
3
2 1
1 1
10 0
SAMPLE OUTPUT
0.666667
0.500000
1.000000
Time Limit: 2.0 sec(s) for each input file.
Memory Limit: 256 MB
Source Limit: 1024 KB
Marking Scheme: Marks are awarded when all the testcases pass.
Allowed Languages: C, C++, Clojure, C#, D, Erlang, F#, Go, Groovy, Haskell, Java, Java 8, JavaScript(Rhino), JavaScript(Node.js), Lisp, Lisp (SBCL), Lua, Objective-C, OCaml, Octave, Pascal, Perl, PHP, Python, Python 3, R(RScript), Racket, Ruby, Rust, Scala 2.11.8, Swift, Visual Basic

CODE EDITOR

Initializing Code Editor...
Your Rating:

Contributor

Notifications
View All Notifications