HHC 2017 RPL Programming contest information and results thread

[Claudio L.]

And here are the scores for my more basic code:

0.4488:
{3 9 230 129375 } error=0

0.422618262:
{ 3 12 169 29040 3243470446 } error*1e12=7.8e-8

0.41421356:
{ 3 13 253 218314 65143073093 } error*1e12=1.9e-10

0.853:
{ 2 3 51 17000 } error=0

0.5:
{ 2 } error=0

Size in bytes (newRPL): 176 bytes.

First term= 68386938021/1e7*176 =1203610

Error term *100 = 0

Notice the errors are smaller because of the 32-digit default precision in newRPL, which makes it pick the last number much more accurately, the classicRPL version should return numbers more in line with what Gene reported.

Final score: 1203610, this is more than the score from my other algorithm squared!

All in all, I liked the challenge, this was fun.

Here's my code for this one (not optimized, as I moved on to the other algorithm):

Code:


(original newRPL code)
«
  0 'K' LSTO DUP WHILE
  DUP 1E-12
  ≥ REPEAT
    DUP INV DUP IP DUP
    UNROT ≠ + DUP UNROT
    INV - 'K' INCR DROP
  END
  DROP K →LIST DUP INV
  ΣLIST ROT - 1E12
  * SWAP 
»

Code:


(userRPL code)
«
  0 → K « DUP WHILE
  DUP 1E-12
  ≥ REPEAT
    DUP INV DUP IP DUP
    UNROT ≠ + DUP UNROT
    INV - 'K' INCR DROP
  END
  DROP K →LIST DUP INV
  ΣLIST ROT - 1E12
  * SWAP 
  »
»