![]() However, it is rewarding to solve these yourself, so I'd encourage readers to give each level (or "year") a good try before looking up solutions. Some have hints if a certain concept or way of thinking about the problem can be key to finding an optimized solution. The below sections have the solutions for each level, for both speed and size. This only saves a few steps, but can sometimes make the difference between meeting the goal or not. ![]() ![]() Sometimes the main outer loop of a program can be rearranged to save a JUMP command by having the INBOX in the middle of the loop, right after the final result is placed in the OUTBOX. ![]() Many later levels can also be improved by loop unrolling, but there is usually a more elegant solution. Each JUMP is an extra command that adds to the step count.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |