ElJudge - Online MIPT programming contest

El Judge

Online MIPT programming contest

Forum || Register || Login || Problem set || Users rating || Online status || FAQ || acm.mipt.ru

<PREV Problem:

Solved by 174 users: ...

The smallest solutions
User	Date	Attempt		Time	CM
Fat	`25 jan 2009`	C++	18	00.01	193
Fat	`25 jan 2009`	C++	19	00.01	194
Fat	`25 jan 2009`	C++	17	00.01	201
Council	`19 oct 2006`	C++	1	00.03	202
Fat	`25 jan 2009`	C++	15	00.01	211
Fat	`25 jan 2009`	C++	14	00.01	215
abortmozga.ru	`30 mar 2009`	C++	20	00.01	235
Jacob	`29 sep 2006`	C++	6	00.02	241
abortmozga.ru	`30 mar 2009`	C++	17	00.01	242
zmy	`14 apr 2006`	C++	6	00.02	242
shura	`29 apr 2004`	Python	1	00.07	242
tourist	`07 nov 2007`	Kylix	2	00.01	245
abortmozga.ru	`30 mar 2009`	C++	16	00.01	245
abortmozga.ru	`30 mar 2009`	C++	19	00.01	246
abortmozga.ru	`30 mar 2009`	C++	18	00.01	248
DAV	`10 jul 2009`	C++	9	00.01	249
Crazy-EyE	`06 oct 2006`	C++	1	00.01	250
shvartsberg	`22 nov 2005`	FPC	2	00.01	250

Languages
C++	96
FPC	39
Kylix	19
C	13
Java	5
Ruby	3
Python	1

 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 <

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.

X_A Y_A X_B Y_B
X₁ Y₁ X₂ Y₂

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:
Barsky Eugene, IV MIPT Olympiad
11 april 2004

<PREV | Problem set | Search related messages | NEXT>