Acceleration#1172
Imagine a -dimensional coordinate system. Bob is at the origin at moment t = 0. He wants to drive his car to point (X > 0). At each coordinate (except the origin), a force equal to pushes Bob toward the origin. Assuming the car has unit mass, determine the minimum acceleration value needed for the car to reach point .
Find the infimum of all acceleration values that allow Bob to reach point . The infimum of a set of numbers is the greatest lower bound of all real values such that
Bob always moves from the origin toward point , never toward the negative side of the axis and then back.
The function is a polynomial in .
The first line contains , the number of test cases. For each test case, the first line contains , the degree of the polynomial , and , the destination coordinate. The next line contains N + 1 real numbers separated by spaces: the -th number is the coefficient of x^i in , for 0 \leq i \leq N. It is guaranteed that 1 \leq T \leq 10000, 0 \leq N \leq 5, 0 < X \leq 10, and coefficients .
Print lines. Each line should contain the infimum of the acceleration values for the respective test case, rounded to decimal places.
Example 1