- Problem A: Deficient, Perfect, and Abundant
- Problem B: Divisibility by 11
- Problem C: Pattern Generator
- Problem D: When in Rome
- Problem E: Maximum Distance

- Problem A: Deficient, Perfect, and Abundant

(dpa.c, dpa.pas) - Problem B: Divisibility by 11 (div.c, div.pas)
- Problem C: Pattern Generator (pat.c, pat.pas)
- Problem D: When in Rome (rom.c, rom.pas)
- Problem E: Maximum Distance (max.c, max.pas)

*Unofficial* solutions:
http://mmhs.ca/ccc/index.htm.

This external website is maintained (as of May 2005) by Chris Robart, Computer Science Teacher, Milliken Mills High School.

- Day 1 Problem 1: Train Swapping
- Day 1 Problem 2: Safebreaker
- Day 1 Problem 3: Quadtrees
- Day 2 Problem 1: Where's Waldorf?
- Day 2 Problem 2: All Roads Lead Where?
- Day 2 Problem 3: Hoppers

- Day 1 Problem 1: Train Swapping
- Day 1 Problem 2: Safebreaker
- Day 1 Problem 3: Quadtrees
- Day 2 Problem 1: Where's Waldorf?
- Day 2 Problem 2: All Roads Lead Where?
- Day 2 Problem 3: Hopper