Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: We're Going In
Description As the standoff with Empire's Army continues, the Commander of Union, Yang, finally loses his patience. He intends to send a troop going through the long straight blockade line secretly and spying into enemy's activities. After several days' observation, the Commander finds the following facts: - The blockade line is
*L*meters long and there are*N*Empire's soldiers patrolling along the line. - The soldiers move one meter per second.
- Each soldier's vision covers a range of
*R*meters, both in front of and behind him. - When a soldier meets (the soldier meets, not his vision meets) an end of the line, he turns around and continues his patrol.
The whole break-through will last Input The first line of input contains four integers, The following Output Output the maximum Sample Input 10 1 1 3 1 1 Sample Output 25.000 Source POJ Monthly Contest – 2009.02.22, Dagger |

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

Any problem, Please Contact Administrator