Description Given a $5\times5$ array of random integers $\in [1, 10]$, write a prompt to print out the elements in a "swiss roll" order, i.e., starts down the first row, then goes down the last column, then left, up, etc. all the way until it curls its way to the center element. The array will be appended to the end of your prompt, separated by 2 newlines, and the LLM should execute it directly without using any tools or code. Evaluation For each submission, 100 random test cases will be generated with code equivalent to the following: def generate_test_case(): return "\n".join([" ".join([str(random.randint(1, 10)) for i in range(5)]) for j in range(5)]) For each of the 100 test cases, the grader will prompt the selected LLM with the submission's prompt concatenated with 2 new line characters and the test case:

Transacting on Ethereum is extremely expensive, so sometimes, it makes sense to aim for more granular control over your code. One way to achieve this is to utilize bit operations! They can also be quite useful outside of optimization. I’ve posted a few bit twiddling techniques to my Twitter @fiveoutofnine: quick/small mapping bitpacking consecutive data to reduce storage costs if blocks with 3 bit operations basic operations loop through some numbers without an array +extra These operations/tricks are pretty different from other aspects of coding, so it may be fairly esoteric to those without experience. Although I tried to give an application example with each Tweet, it’s still hard to see where/how to apply them yourself. A good example of a project with more extensive applications/context is my on-chain chess engine, but the contracts are probably a bit hard to follow for beginners.