![]() | ||||
Online Judge | Problem Set | Authors | Online Contests | User |
---|---|---|---|---|
Web Board Home Page F.A.Qs Announcement | Current Contest Past Contests Scheduled Contests Award Contest |
Match Throwing Game Time Limit:1000MS Memory Limit:65536K
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. OutputFor each case, output P in a single line. Sample Input
POJ Monthly--2005.08.28,kicc |
[Submit] [Go Back] [Status] [Discuss]
All Copyright Reserved 2003-2005 Ying Fuchen,Xu Pengcheng
Any problem, Please Contact Administrator