Perfect Parking

[Thomas Klemm]

Here's what I came up with using your formula:

Code:

00 { 35-Byte Prgm }
01▸LBL "PARKING"
02 X<>Y
03 R↑
04 X↑2
05 X<>Y
06 R↑
07 +
08 X<>Y
09 LASTX
10 X↑2
11 -
12 SQRT
13 ENTER
14 +
15 R↑
16 X<>Y
17 R↑
18 -
19 ×
20 X<>Y
21 X↑2
22 +
23 SQRT
24 X<>Y
25 -
26 END

But alas, it takes 2 more bytes.

I also tried using local variables:

Code:

\<< \-> r l k w
  \<< l k + DUP SQ r SQ l SQ - \v/ DUP + w - w * + \v/ SWAP -
  \>>
\>>

Of course it takes more bytes than your solution.