• Div-II topics will include formatting output, control structures (branching/looping), boolean logic, string manipulation, basic one-dimensional lists/arrays
• Div-I topics will include all of Div-II topics plus multi-dimensional lists/arrays, recursion, sorts/searching, data structures (lists and trees), and other advanced algorithmic topics.

Each team brings one computer. At the start of the contest a set of programming problems is distributed to the teams. The students write programs to solve as many of these problems as they can. They divide tasks among themselves and work cooperatively in any way they wish. As soon as a team believes it has a program that solves a problem, they submit their program through an on-line submission system (Note: each team machine must have networking capability) If the program is not successful, the team is allowed to resubmit a revised solution. Each correct solution submitted will also receive a 'time score' which represents the total time since the start of the contest plus any time penalties for incorrect submissions. The time scores only come into play when there is a tie with the same number of problems solved.

For example Team 1 solves its first problem in 30 minutes on its first submission. Team 1 now has a score of 1 with a time score of 30. In another 20 minutes (at the 50 minute mark of the contest) Team 1 solves a second problem on its first submission. Team 1 now has a score of 2 with a time score of 80 (30 + 50). Team 2 submits a wrong solution for its first problem 15 minutes into the contest. They are able to fix it and resubmit at the 45 minute mark of the contest. Team 2 would have a score of 1 with a time score of 65 (solution at 45 + 20 min penalty for wrong submission). If that was the end of the contest, Team 1 would win simply because they solved more problems... the time score only comes into play if two teams have the same number of problems solved, then it is lowest time score wins.

Contest problems have a very wide range of difficulty.  We will provide a different set of problems for each division, although there will be some common problems I am sure. We try to include at least two problems that every team could solve—we also include two or three that would be appropriate for college students.

Here is a sample of the style of problems that students will see... these are easy to easy/medium. Sample Programs. All inputs must be entered from standard in (keyboard) and all output is sent to standard out (console window)

Plaques and prizes will be awarded through 3 places for Division I and Division II.