|
||||||||||
Wow! Such Precision!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 148 Accepted Submission(s): 30 Special Judge Problem Description Professor Doge is now working on a project using polynomial for some mathematical calculations. In his project, he wants to approximate the exponential function ex with a polynomial whose degree does not exceed n. As one of professor’s assistants, you are asked to find a polynomial f (x) with degree n that minimizes Input There are several test cases, please process till EOF. Each test case consists of only one integer denoting the degree n of the polynomial (0 ≤ n ≤ 10). Output For each test case, print n + 1 lines. for the i-th line, print one floating number ai denoting the coefficient in the term xi, i = 0, 1, . . . , n. It is guaranteed that the answer is always unique. Any answer within an absolute error less than or equal to 10-50 would be accepted. Sample Input
Sample Output
Source | ||||||||||
|