mBIT is a competitive programming competition for computer science students of all skill levels, organized by students from Montgomery Blair High School.

Competitors work in teams of up to four to solve interesting and challenging programming problems. There are prizes for the top teams in each division.

For more information, be sure to visit the logistics and rules pages. If you have any questions about the competition, feel free to email us at mbit.organizers@gmail.com.

If you are looking to practice for the competition, past mBIT problems, old USACO problems, and the USACO training pages are great places to start. Keep in mind that the problems in the competition will primarily focus on thinking and problem solving, not rote memorization of algorithms and data structures.

mBIT offers two divisions: Standard and Advanced.

Standard: recommended for new competitive programmers and those in Bronze and Silver (or equivalent) USACO divisions. Topics may include: loops, lists, maps, recursion, basic math operations, and introductory to intermediate algorithms such as brute force, simulation, BFS, DFS and binary search.

Advanced: recommended for competitive programmers in Gold and Platinum (or equivalent) USACO divisions. Topics may include: dynamic programming, segment trees, combinatorics, number theory, and other advanced algorithms and data structures.

Take a look at our archive to get a sense of the difficulty of each division. Additionally, sample problems are available for download here, and the solutions are available here (but you should try them first!). Note that we have renamed the rookie and varsity divisions to standard and advanced. If you can solve each of the standard ones easily, you should probably compete under advanced. Also, note that the standard division will feature more easier problems (with the same number of intermediate problems) than in previous years.