Problem Statement  
NOTE: This problem statement contains subscripts and superscripts which may not display properly for plugin users.
Write a program to generate a list of random 3D points in space, and then compute the distance between the pair of closest points. Also determine how many distinct pairs of points are this exact distance apart. Generate the random points using the following pseudorandom number generator. Starting with a given seed_{0}: seed_{i+1} = (seed_{i} * 16807) mod (2^{31}1) The ith random number (starting at i = 1) is given by: rand_{i} = (seed_{i} mod (2 * range))  range The 3D points are triples of 3 successive random numbers: (rand_{1}, rand_{2}, rand_{3}) (rand_{4}, rand_{5}, rand_{6}) (rand_{7}, rand_{8}, rand_{9}) (rand_{10}, rand_{11}, rand_{12}) etc... You will be given an initial seed, the range, and N (the number of points). The random numbers produced by the generator will be between range and range1, inclusive. Return a int[] with two elements: the first element should be the square of the distance between the pair of closest points, and the second element should be the number of distinct pairs of points that have this same squared distance. NOTE: Be sure to use 64bit arithmetic for the multiply and mod in the randomnumber generator, and for computing squared distances.  
Definition  
 
Notes  
  Ignore any duplicate points. (See example 1.)  
  There will be at least 2 unique points.  
Constraints  
  N will be between 2 and 150000, inclusive.  
  range will be between 1 and 1000000, inclusive.  
  seed will be between 1 and 1000, inclusive.  
  The square of the distance of the closest pair of points will be less than 1000000000.  
Examples  
0)  
 
1)  
 
2)  
 
3)  
 
4)  
