Nick Kennedy

@RGS yes, was replying to the question about the slice quick. I’ve been using Jelly for about a year. Learnt a lot from @JonathanAllan and others.

@RGS because not all links automatically vectorise.

The relevant link is applied to the whole list, and then the slice quick only replaces the selected members of the source array with their corresponding values in the result.

Yes. The ’1¦ uses the slice quick to apply a monad just to one of the elements in a list. It’s worth having a look at the Python code for it, because it took me a little while to get my head around it.

and the µ is redundant, and Ẉ is the same as L€

You can also replace 0,1 with Ø.

Sorry that should have been ‘1¦

You could just do ‘-1¦

@Adám I was planning to get the highest valid n possible with a 10 minute run time on Linux. This would restrict it to languages with a freely available implementation. The expectation would be that the answerer gives an indication of n on their own machine and then I would verify it. Does that seem reasonable? I’m also still happy to stick to Code Golf, and note that they tend to attract more answers.

Would it be possible please to have some more feedback on my Sandbox post codegolf.meta.stackexchange.com/a/18414/42248 prior to posting to live? In particular, should I make it code golf or fastest code? The challenge involves counting the number of different buildings that can be made from n identical cubes without overhangs, and I think represents a new integer sequence.

I’ve made my first Sandbox post. codegolf.meta.stackexchange.com/a/18310/42248 Any comments? It’s derived from another question, but that one was designed to get tips to shorten a C function.

@pasbi got it down to 1 byte extra in the end. I’ll post an explanation later.

The first example is trivial since it will always be zero. Do we have to handle the degenerate case of one bowl? It will add unnecessary complexity to my solution to give an obvious answer.