Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Announcement
Problems
Submit Problem
Status (Online)
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest

Match Throwing Game

Time Limit:1000MS  Memory Limit:65536K
Total Submit:525 Accepted:122

Description

There is a very simple but interesting game. In this game we have a match and a table with some parallel lines on it (as shown in the figure). We have known that the distance between two neighboring lines on the table are all 1 and the length of the match is L. For the match is very thin, we ignore the width of the match, and treat the match as a line segment. Then we throw the match for 1000 times, sometimes the match will intersect with lines (the case that one ending point of the match is on the lines is also treated as intersecting), and sometimes not. When throwing, we count how many times the match intersects with the lines (we use P to record the number of intersecting cases). You job is to calculate the most probable value of P.


Why this game is interesting? Let's take L = 0.5 for example, in this case, P will be 318. 1000 / 318 = 3.14..., do you see something interesting?

Input

The input consists of many test cases. Each case contains a float number L (0 < L < 10) in a single line.

Output

For each case, output P in a single line.

Sample Input

0.5
1.21

Sample Output

318
718

Source

POJ Monthly--2005.08.28,kicc

[Submit]   [Go Back]   [Status]   [Discuss]

Home Page   Go Back  To top


All Copyright Reserved 2003-2005 Ying Fuchen,Xu Pengcheng
Any problem, Please Contact Administrator