Carnegie Mellon Informatics and Mathematics Competition

In the Theoretical Computer Science (TCS) Round, you will come up an algorithm that represents your best possible solution. Here, "best" is defined differently for each problem - it could be the number of moves that your algorithm makes, or the number of points it earns.

This is a proof-based round, so you will also need to prove the correctness of your algorithm. This means proving that it always solves the given problem, as well as proving that it attains the claimed bound. You will get a higher score for proving a better bound, according to a pre-defined rubric.

You'll be working with your team to solve 3 problems in 90 minutes. You can see the sample problem for a good example of what you'll need to do. No coding experience is required, only algorithmic thinking!