FUNPROB  Yanu in Movie theatre
Yanu is a great fan of Harry Potter.So on the day of the movie release, Yanu rushes to the movie theatre to watch the movie. On the release of the 6th movie, on reaching the theatre she found a long queue for tickets already.As the distirbution was about to start, the ticket counter did not have any change to start with. There are N+M people in queue,where N have Rs 10.00 and M have Rs 5.00. The ticket costs Rs 5.00.
Now Yanu is math geek too , now she wonders What is the probability that the theatre can always provide change.
Input
Each line contain N and M , seperated by a space , End of Input is marked by 0 0 which should not be processed. Both N and M fits in integer range.
Output
For each input , output the respective probability upto 6 decimal digits.
Example
Input:
1 0
0 1
41 41
0 0
Output:
0.000000
1.000000
0.023810
hide comments
abhi2296:
20160509 17:05:20
my 50th!!! Easy! 

azam_9:
20160131 06:57:58
my 50th..ac in 1 go...<3 

sohie:
20150904 03:33:27
here is explanation of the solution


anuveshkothari:
20150721 21:10:22
Last edit: 20150721 21:10:57 

vikas:
20140811 12:49:13
whats the logic for O(1)? any useful links to understand ? 

pvkcse:
20140523 12:14:27
AC in one go with python...good problem on probability...had some work with pen and paper...!!! Last edit: 20140523 12:16:34 

chaudhary:
20130606 16:46:10
easy question!! 

Himanshu:
20130518 06:44:39
lol problem a guess can also work........... 

gourav:
20121225 09:39:43
lol... in one go, i thought it a difficult problem. :p sorry yani , you enjoy your movie :) 

unXled:
20120627 07:44:16
tutorial ! 
Added by:  Hemant Verma 
Date:  20090815 
Time limit:  0.506s 
Source limit:  1024B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  A Classical Probability Problem 