|
||||||||||
k-th pointTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 302 Accepted Submission(s): 82 Special Judge Problem Description Consider n data points uniformly distributed in a p-dimensional unit ball centered at the origin. What is the expected distance of the k-th farthest point? (Here k start from 0 to n-1, and 0-th is the farthest point, (n-1)-th is the nearest point.) Input The first line contains a number T(T¡Ü100), which is the number of the case number. The next T lines, each line contains a number p, n and k(1¡Üp, n¡Ü104,0¡Ük¡Ün-1) you need to consider. Output For each p, n and k, output the expected distance in a single line.The answer will be considered correct if the absolute or relative error doesn't exceed 10-4. Sample Input
Sample Output
Source | ||||||||||
|