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: Long Distance Racing
Description Bessie is training for her next race by running on a path that includes hills so that she will be prepared for any terrain. She has planned a straight path and wants to run as far as she can -- but she must be back to the farm within The entire path she has chosen is Bessie takes Find the farthest distance Bessie can get from the farm and still make it back in time. Input * Line 1: Five space-separated integers: Output * Line 1: A single integer that is the farthest distance (number of units) that Bessie can get from the farm and make it back in time. Sample Input 13 5 3 2 1 u f u d f Sample Output 3 Source |

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

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator