Brookfield Computer Programming Challenge (BCPC)
Last week I learned how to use Polygon, so I uploaded and regenerated data/solutions to the first contest I ever wrote, and uploaded it to the gym. The final score of the original contest is available here. In the original contest, the last problem was only unlocked after solving everything else (which no teams did). Originally this was a set for high school students in Wiscosin, but I thought some people here might enjoy speedrunning it.
Solution videos are also available here. They aren't very good because I was a young child when I made them, but they should at least convey the main ideas pretty well. The one interesting thing to mention is:
For problem LAST Robotics:
It turns out there is a 1-line solution, which you don't need in order to solve the problem, but it's quite neat:
It's just the parity of the number of one-bits in the binary representation of n-1!
Proof left as an exercise to the reader :).
I hope you enjoy! Let me know if there are any technical issues, because those may indicate that I've set something up incorrectly, which was kind of the main thing I was trying to avoid here.