So I'm working on a solution for Project Euler Problem 18 (and by extension 67) and just trying to find a good way to represent the binary tree in APL is an interesting challenge in and of itself
@TessellatingHeckler ⊥ doesn't care if you have "invalid" digits. a⊥x y z is always xa²+yx¹+zx⁰, so for a=1, x=2, y=0, z=3, you get a2×1²+0×1¹+3×0⁰=5, i.e. the sum, +/ (well, +⌿ to be precise).
Hrm, there has to be a golfier way to do the whole problem than just (grabbing a last line, taking the pairwise max, adding it to the second-to-last line, and appending that new line to the rest of the array), but I'm not seeing it
@J.Sallé John Scholes once rigged a presentation of his so that all of a sudden a number was printed into his session, to which he remarked that he doesn't know where that came from,. Then a while later during his demonstration he wrote ⎕DL with a negative number, and then commented that now he knows where that number had come from.
@Adám I've gotten a nonce error, which I've never seen before, running this code ⍸{1pco⌊○10*⍵-1}¨⍳10. I think it's pco throwing it, but I'm not sure. What does it mean?
It runs fine for ¨⍳9, that's why I think it's pco's fault
I've tried setting ⎕FR←1287 and ⎕PP←34 to no avail.
@J.Sallé nonce seems to only be happening in extended, in unicode it's giving domain error, i'm assuming that's pco just refusing to work with numbers that big no matter what