Solved by 197 users: ...
UserDateAttemptTimeCMSC
Fat`25 jan 2009`C++1800.01193
Fat`25 jan 2009`C++1900.01194
Fat`25 jan 2009`C++1700.01201
Council`19 oct 2006`C++100.03202
Fat`25 jan 2009`C++1500.01211
Fat`25 jan 2009`C++1400.01215
abortmozga.ru`30 mar 2009`C++2000.01235
Jacob`29 sep 2006`C++600.02241
abortmozga.ru`30 mar 2009`C++1700.01242
zmy`14 apr 2006`C++600.02242
shura`29 apr 2004`Python100.07242
tourist`07 nov 2007`Kylix200.01245
abortmozga.ru`30 mar 2009`C++1600.01245
abortmozga.ru`30 mar 2009`C++1900.01246
tiabaldu`10 apr 2015`Python100.06246
abortmozga.ru`30 mar 2009`C++1800.01248
DAV`10 jul 2009`C++900.01249
Crazy-EyE`06 oct 2006`C++100.01250
 C++ 113 FPC 40 Kylix 19 C 18 Java 5 Ruby 3 Python 2
` >  >  >  >  >  >  >  >  >  > `

## The optimal path

Time limit = 2 seconds

Memory limit = 8 Mb

Peter is at the point A of primeval forest. He wants to reach point B in the fastest way. There is a straight path in the forest. Peter can go through the forest with a speed of 5 km/h, and through the path with a speed of 5*sqrt(2) km/h. You are to calculate the time, it will take Peter to get the point B.

Input Input contains 8 numbers, separated with spaces and new lines. They are the co-ordinates of the points A и B and the co-ordinates of the two different points of the path.

```XA YA XB YB
X1 Y1 X2 Y2
```
All the numbers are not greater than 1000

Output The time in hours with two digits accuracy.

 Input#1```0 1 0 -1 -1 0 1 0 ``` Output#1```0.40 ```

Author: