Problem Statement 

John and Brus have become very famous people all over the world, especially in Bolivia.
Stories written about them by a Bolivian man have become very popular in that country.
John and Brus have decided to visit their fans in Bolivia, but unfortunately, they only have time to visit one city each.
John will randomly choose one city.
Each city has the same probability of being chosen.
If he chooses the ith city, he will meet between minJ[i] and maxJ[i] fans, inclusive.
Each possible number of fans is equally likely.
Brus will go through the exact same process, but in his case, the number of fans he would meet in the ith city is between minB[i] and maxB[i], inclusive.
Note that John and Brus are not required to visit different cities.
Return the probability that John and Brus will each meet the same number of fans.


Definition 
 Class:  TheFansAndMeetingsDivTwo  Method:  find  Parameters:  int[], int[], int[], int[]  Returns:  double  Method signature:  double find(int[] minJ, int[] maxJ, int[] minB, int[] maxB)  (be sure your method is public) 




Notes 
  The returned value must be accurate to within a relative or absolute value of 1E9. 

Constraints 
  minJ will contain between 1 and 50 elements, inclusive. 
  minJ, maxJ, minB and maxB will contain the same number of elements. 
  Each element of minJ, maxJ, minB and maxB will be between 1 and 50, inclusive. 
  The ith element of minJ will be less than or equal to the ith element of maxJ. 
  The ith element of minB will be less than or equal to the ith element of maxB. 

Examples 
0)  
  Returns: 0.3333333333333333  Brus will definitely meet one fan, and the probability of John meeting one fan as well is 1/3.



1)  
 {5, 7, 7, 1, 6, 1, 1}  {8, 9, 7, 3, 9, 5, 3}  {9, 12, 10, 14, 50, 9, 10}  {9, 13, 50, 15, 50, 12, 11} 
 Returns: 0.014880952380952378  The only possible same number of fans that John and Brus can meet is 9. In order for them to meet 9 fans, John must visit city 1 or city 4 and Brus must visit city 0 or city 5. 


2)  
  Returns: 0.0  No chance to meet the same number of fans. 


3)  
 {1, 6, 3, 1, 4, 3, 5, 1}  {7, 8, 5, 7, 9, 7, 9, 3}  {5, 1, 5, 3, 1, 2, 4, 1}  {9, 2, 7, 9, 4, 5, 4, 9} 
 Returns: 0.11562305130385474  
