F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

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
0 1
 

Sample Output
1.7182818284590452353602874713526624977572470936999595749 0.8731273138361809414411498854106499910289883747998382998 1.6903090292457285878382751718840250134565174378002425501
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-26 05:00:15, Gzip enabled